LPMaxFlow

class LPMaxFlow[N](val g: FlowGraph[N])
class Object
trait Matchable
class Any

Value members

Concrete methods

def minCostFlow(minimumFlow: Double): (Map[Edge, Double], Double)

Concrete fields

val g: FlowGraph[N]
lazy val maxFlow: (Map[Edge, Double], Double)