MinimumEdgeCutAllStPicardQueyranne (JGAlgo - Parent 0.5.1-SNAPSHOT API)

java.lang.Object
- com.jgalgo.alg.connect.MinimumEdgeCutAllStAbstract
- - com.jgalgo.alg.connect.MinimumEdgeCutAllStPicardQueyranne

All Implemented Interfaces:

MinimumEdgeCutAllSt
```
public class MinimumEdgeCutAllStPicardQueyranne
extends MinimumEdgeCutAllStAbstract
```
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
  
  Constructors
  Constructor Description
  
  MinimumEdgeCutAllStPicardQueyranne()
  Create 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 Detail
  - MinimumEdgeCutAllStPicardQueyranne
```
public MinimumEdgeCutAllStPicardQueyranne()
```
    Create a new instance of the algorithm.
    Please prefer using MinimumEdgeCutAllSt.newInstance() to get a default implementation for the MinimumEdgeCutAllSt interface.