Namespace MoreStructures.Graphs.Sorting

Classes

AnyPathToSinkBasedTopologicalSort

An ITopologicalSort implementation which assigns topological order to vertices by identifing a sink vertex at each iteration in a non-deterministic way, picking some start vertex and following some path to a sink.

DfsOnEachVertexSinkBasedTopologicalSort

An ITopologicalSort implementation which assigns topological order to vertices by identifing a sink vertex at each iteration in a deterministic way, running DFS on each vertex and selecting the max sink.

SingleDfsSinkBasedTopologicalSort

An ITopologicalSort implementation which assigns topological order to vertices by identifing a sink vertex at each iteration in a deterministic way, by running DFS once on the entire graph and storing the post order.

Interfaces

ITopologicalSort

An algorithm performing a topological sort on the provided IGraph.