Package com.jgalgo.alg.connect
Class StronglyConnectedComponentsPathBasedDfs
java.lang.Object
com.jgalgo.alg.connect.StronglyConnectedComponentsAlgoAbstract
com.jgalgo.alg.connect.StronglyConnectedComponentsPathBasedDfs
- All Implemented Interfaces:
StronglyConnectedComponentsAlgo
public class StronglyConnectedComponentsPathBasedDfs
extends StronglyConnectedComponentsAlgoAbstract
Path based DFS implementation of Dijkstra's strongly connected components algorithm.
The algorithm run in linear time and use linear space.
Based on 'A Discipline of Programming' by Edsger W. Dijkstra, 1976.
- Author:
- Barak Ugav
-
Constructor Summary
ConstructorDescriptionCreate a new instance of the algorithm. -
Method Summary
Methods inherited from class com.jgalgo.alg.connect.StronglyConnectedComponentsAlgoAbstract
findStronglyConnectedComponents, isStronglyConnected
-
Constructor Details
-
StronglyConnectedComponentsPathBasedDfs
public StronglyConnectedComponentsPathBasedDfs()Create a new instance of the algorithm.Please prefer using
StronglyConnectedComponentsAlgo.newInstance()
to get a default implementation for theStronglyConnectedComponentsAlgo
interface.
-