|
||||||||||
| PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES | |||||||||
| Class Summary | |
|---|---|
| NagamochiMinCut<V,E extends Edge<V>,G extends Graph<V,E>> | Compute the minimum cut of a graph. |
| StoerWagnerMinCut<V,E extends Edge<V>> | This algorithm is based on: A simple min-cut algorithm Source Journal of the ACM (JACM) archive Volume 44 , Issue 4 (July 1997) table of contents Pages: 585 - 591 Year of Publication: 1997 ISSN:0004-5411 Authors Mechthild Stoer Televerkets Forskningsinstitutt, Kjeller, Norway Frank Wagner Freie Univ. |
|
||||||||||
| PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES | |||||||||