Package com.jgalgo.alg.closure
Class ClosuresEnumeratorSchrageBaker
java.lang.Object
com.jgalgo.alg.closure.ClosuresEnumeratorAbstract
com.jgalgo.alg.closure.ClosuresEnumeratorSchrageBaker
- All Implemented Interfaces:
ClosuresEnumerator
Schrage-Baker algorithm for enumerating all the closure subsets in a directed graph.
Based on 'Dynamic Programming Solution of Sequencing Problems with Precedence Constraints' by Linus Schrage and Kenneth R. Baker (1978).
- Author:
- Barak Ugav
-
Constructor Summary
ConstructorDescriptionConstructs a new instance of the algorithm. -
Method Summary
Methods inherited from class com.jgalgo.alg.closure.ClosuresEnumeratorAbstract
closuresIter
-
Constructor Details
-
ClosuresEnumeratorSchrageBaker
public ClosuresEnumeratorSchrageBaker()Constructs a new instance of the algorithm.Please prefer using
ClosuresEnumerator.newInstance()
to get a default implementation for theClosuresEnumerator
interface.
-