StronglyConnectedComponentsPathBasedDfs (JGAlgo - Parent 0.5.1-SNAPSHOT API)

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
  
  Constructors
  Constructor Description
  
  StronglyConnectedComponentsPathBasedDfs()
  Create a new instance of the algorithm.
- Method Summary
  - Methods inherited from class com.jgalgo.alg.connect.StronglyConnectedComponentsAlgoAbstract
    findStronglyConnectedComponents, isStronglyConnected
  - Methods inherited from class java.lang.Object
    equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

- Constructor Detail
  - StronglyConnectedComponentsPathBasedDfs
```
public StronglyConnectedComponentsPathBasedDfs()
```
    Create a new instance of the algorithm.
    Please prefer using StronglyConnectedComponentsAlgo.newInstance() to get a default implementation for the StronglyConnectedComponentsAlgo interface.