Package com.jgalgo.alg.connect
Class MinimumEdgeCutAllStPicardQueyranne
java.lang.Object
com.jgalgo.alg.connect.MinimumEdgeCutAllStAbstract
com.jgalgo.alg.connect.MinimumEdgeCutAllStPicardQueyranne
- All Implemented Interfaces:
MinimumEdgeCutAllSt
Picard-Queyranne algorithm for enumerating all the minimum edge cuts between two terminal nodes.
Based on 'On the structure of all minimum cuts in a network and applications' by 'Picard, Queyranne (1985).
- Author:
- Barak Ugav
-
Constructor Summary
ConstructorDescriptionCreate a new instance of the algorithm. -
Method Summary
Methods inherited from class com.jgalgo.alg.connect.MinimumEdgeCutAllStAbstract
minimumCutsIter
Methods inherited from class java.lang.Object
equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
Methods inherited from interface com.jgalgo.alg.connect.MinimumEdgeCutAllSt
allMinimumCuts
-
Constructor Details
-
MinimumEdgeCutAllStPicardQueyranne
public MinimumEdgeCutAllStPicardQueyranne()Create a new instance of the algorithm.Please prefer using
MinimumEdgeCutAllSt.newInstance()
to get a default implementation for theMinimumEdgeCutAllSt
interface.
-