Class DirectedDepthFirstSearch

Provides and algorithm for finding all vertices reachable from a given vertex or set of vertices in a directed graph.

public class DirectedDepthFirstSearch

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 DirectedDepthFirstSearch class.

public DirectedDepthFirstSearch(IDigraph digraph, IEnumerable<int> startVertexes)

Initializes a new instance of the DirectedDepthFirstSearch class.

public DirectedDepthFirstSearch(IDigraph digraph, int startVertex)

public bool IsConnectedToSources { get; }

Checks whether a given vertex is reachable from the start vertex or vertices.

public bool Reachable(int vertex)