Class Kosaraju

Provides an algorithm for finding the strongly connected components of a directed graph.

public class Kosaraju

Inherited Members: object.Equals(object)

object.Equals(object, object)

object.GetHashCode()

object.GetType()

object.MemberwiseClone()

object.ReferenceEquals(object, object)

object.ToString()

Extension Methods: Applications.ApplyInterpolationRule<T, TBuffer>(TBuffer, Func<T, T, T>)

Applications.ApplyInterpolationRule<T, TBuffer>(TBuffer, Func<T, T, T>, int)

Applications.Interpolate<T, TBuffer>(TBuffer, Func<T, T, T>, int)

Applications.Substitute<T, TBuffer>(TBuffer, (T input, T[] output)[])

Comparable.ToComparable<T>(T, IComparer<T>)

Formatter.AsText<T>(T?)

Formatter.Describe<TLabel, TDescription>(TLabel, TDescription, string)

Formatter.Log<T>(T)

Formatter.Pretty<T>(T, params int[])

Constructors

Initializes a new instance of the Kosaraju class.

public Kosaraju(IDigraph digraph)

Gets the number of strongly connected components in the graph.

public int ConnectedComponentCount { get; }

Gets the connected component ID of a vertex.

public int GetConnectedComponentId(int vertex)

Checks whether two vertices are strongly connected.

public bool StronglyConnected(int vertex1, int vertex2)