Open vsaveris opened 4 years ago
Implementation of the SCC algorithm, which finds all the Strongly Connected Components of a graph G = (V, E).
Should be included in the GraphAlgorithms class.
See chapter 3 DPV
Implementation of the SCC algorithm, which finds all the Strongly Connected Components of a graph G = (V, E).
Should be included in the GraphAlgorithms class.