Esempio n. 1
0
        /// <summary>
        /// This is using ariticulation alogrithm based on the observation that
        /// a graph is BiConnected if and only if there is no articulation Points.
        /// </summary>
        public bool IsBiConnected(IGraph <T> graph)
        {
            var algorithm = new TarjansArticulationFinder <T>();

            return(algorithm.FindArticulationPoints(graph).Count == 0);
        }
Esempio n. 2
0
        /// <summary>
        /// This is using ariticulation alogrithm based on the observation that
        /// a graph is BiConnected if and only if there is no articulation Points.
        /// </summary>
        public bool IsBiConnected(Graph <T> graph)
        {
            var articulationAlgo = new TarjansArticulationFinder <T>();

            return(articulationAlgo.FindArticulationPoints(graph).Count == 0);
        }