DinicMaxFlow<V> constructor

DinicMaxFlow<V>({
  1. required Iterable<V> seedVertices,
  2. required Iterable<V> successorsOf(
    1. V vertex
    ),
  3. num edgeCapacity(
    1. V source,
    2. V target
    )?,
  4. StorageStrategy<V>? vertexStrategy,
})

Implementation

DinicMaxFlow({
  required Iterable<V> seedVertices,
  required Iterable<V> Function(V vertex) successorsOf,
  num Function(V source, V target)? edgeCapacity,
  StorageStrategy<V>? vertexStrategy,
}) : this._(
        seedVertices: seedVertices,
        successorsOf: successorsOf,
        edgeCapacity: edgeCapacity ?? constantFunction2(1),
        vertexStrategy: vertexStrategy ?? StorageStrategy.defaultStrategy(),
      );