SimplePathsEnumeratorSedgewick (JGAlgo - Parent 0.5.1-SNAPSHOT API)

java.lang.Object
- com.jgalgo.alg.shortestpath.SimplePathsEnumeratorAbstract
- - com.jgalgo.alg.shortestpath.SimplePathsEnumeratorSedgewick

All Implemented Interfaces:

SimplePathsEnumerator
```
public class SimplePathsEnumeratorSedgewick
extends SimplePathsEnumeratorAbstract
```
Sedgewick's simple paths enumerator implementation.
The algorithm is a variant of DFS, that mark visited vertices, but unmark them when the DFS backtracks.
Based on 'Algorithms in c, part 5: graph algorithms' by Robert Sedgewick.

Author:

Barak Ugav

- Constructor Summary
  
  Constructors
  Constructor Description
  
  SimplePathsEnumeratorSedgewick()
  Create a algorithm for enumerating over all simple paths between a source and target vertices.
- Method Summary
  - Methods inherited from class com.jgalgo.alg.shortestpath.SimplePathsEnumeratorAbstract
    simplePathsIter
  - Methods inherited from class java.lang.Object
    equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
  - Methods inherited from interface com.jgalgo.alg.shortestpath.SimplePathsEnumerator
    allSimplePaths

- Constructor Detail
  - SimplePathsEnumeratorSedgewick
```
public SimplePathsEnumeratorSedgewick()
```
    Create a algorithm for enumerating over all simple paths between a source and target vertices.
    Please prefer using SimplePathsEnumerator.newInstance() to get a default implementation for the SimplePathsEnumerator interface.