Class DirectedCycle

Provides an algorithm for finding a directed cycle in a digraph== if one exists.

public class DirectedCycle

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

public DirectedCycle(IReadOnlyDigraph digraph)

Gets a value indicating whether the graph has a directed cycle.

public bool HasCycle { get; }

Returns the vertices in a directed cycle, if one exists.

public IEnumerable<int> Cycle()