Package | Description |
---|---|
org.jgrapht.alg.flow |
Modifier and Type | Class and Description |
---|---|
class |
EdmondsKarpMaximumFlow<V,E>
A flow network is a
directed graph where each edge has a capacity and each edge receives a flow.
|
class |
PushRelabelMaximumFlow<V,E>
Push-relabel maximum flow algorithm designed by Andrew V.
|
Copyright © 2016. All rights reserved.