Implementation of the Tarjan stronly connected components algorithm.
More...
Implementation of the Tarjan stronly connected components algorithm.
- See also
- http://en.wikipedia.org/wiki/Tarjan's_strongly_connected_components_algorithm, http://stackoverflow.com/questions/261573/best-algorithm-for-detecting-cycles-in-a-directed-graph
static LinkedList<LinkedList<Part> > RUI.Algorithms.StronglyConnectedComponentFinder.DetectCycle |
( |
FlowGraph< Part > |
flowGraph | ) |
|
|
inlinestatic |
Calculates the sets of strongly connected vertices.
- Parameters
-
flowGraph | Graph to detect cycles within. |
- Returns
- Set of strongly connected components (sets of vertices)
static LinkedList<HashSet<Part> > RUI.Algorithms.StronglyConnectedComponentFinder.DetectCycleSets |
( |
FlowGraph< Part > |
flowGraph | ) |
|
|
inlinestatic |
The documentation for this class was generated from the following file: