| 
||||||||||
| PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES | |||||||||
See:
          Description
| Class Summary | |
| MinCut | Provides an algorithm to compute the maximum st-flow and so minimum st-cut of a simple directed graph The algorithm used to compute the s-t flow max is Edmonds-Karp algorithm. | 
This package contains algorithms working on digraphs.
  | 
||||||||||
| PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES | |||||||||