Class Algorithms

Namespace

AlgorithmsSW.Digraph

Assembly

AlgorithmsSW.dll

public static class Algorithms

Inheritance

object

Algorithms

Inherited Members

object.Equals(object)

object.Equals(object, object)

object.GetHashCode()

object.GetType()

object.MemberwiseClone()

object.ReferenceEquals(object, object)

object.ToString()

Methods

AsGraph(IReadOnlyDigraph)

public static IReadOnlyGraph AsGraph(this IReadOnlyDigraph graph)

Parameters

graph IReadOnlyDigraph

Returns

IReadOnlyGraph

ConnectComponents(IDigraph)

Add edges to a directed graph to make it strongly connected.

public static void ConnectComponents(this IDigraph graph)

Parameters

graph IDigraph

The graph to make strongly connected.

IsTopologicalOrder(IDigraph, IEnumerable<int>)

[ExerciseReference(4, 2, 9)]
public static bool IsTopologicalOrder(this IDigraph digraph, IEnumerable<int> order)

Parameters

digraph IDigraph

order IEnumerable<int>

Returns

bool

Reverse(IDigraph)

Reverses a directed graph.

public static IDigraph Reverse(this IDigraph digraph)

Parameters

digraph IDigraph

The graph to reverse.

Returns

IDigraph