Show / Hide Table of Contents

    Class TarjansBiConnected<T>

    Finds if a graph is BiConnected.

    Inheritance
    Object
    TarjansBiConnected<T>
    Inherited Members
    Object.ToString()
    Object.Equals(Object)
    Object.Equals(Object, Object)
    Object.ReferenceEquals(Object, Object)
    Object.GetHashCode()
    Object.GetType()
    Object.MemberwiseClone()
    Namespace: Advanced.Algorithms.Graph
    Assembly: Advanced.Algorithms.dll
    Syntax
    public class TarjansBiConnected<T>
    Type Parameters
    Name Description
    T

    Methods

    IsBiConnected(Graph<T>)

    This is using ariticulation alogrithm based on the observation that a graph is BiConnected if and only if there is no articulation Points.

    Declaration
    public bool IsBiConnected(Graph<T> graph)
    Parameters
    Type Name Description
    Graph<T> graph
    Returns
    Type Description
    Boolean
    Back to top Generated by DocFX