Namespace MoreStructures.Graphs.StronglyConnectedComponents

Classes

NaiveSccFinder

A simple implementation of ISccFinder, which builds a "reachability dictionary", by running a DFS on each vertex of the graph separately.

SinkSccBasedSccFinder

An efficient implementation of ISccFinder, which runs a single DFS on the inverted graph to calculate post orders, and then uses the post orders to identify sink SCC.

Interfaces

ISccFinder

An algorithm finding the Strongly Connected Components (SCC) of a IGraph.