AlgorithmsGraphExtension<V, E> extension

on

• Graph<V, E>

Methods

maxFlow({num edgeCapacity(V source, V target)?, StorageStrategy<V>? vertexStrategy}) → DinicMaxFlow<V>

Returns an object that can compute the maximum flow between different vertices of this graph using the Dinic max flow algorithm.

minCut({num edgeWeight(V source, V target)?, StorageStrategy<V>? vertexStrategy}) → StoerWagnerMinCut<V, E>

Returns an object that computes the min-cut using the Stoer-Wagner algorithm.

shortestPath(V source, V target, {num edgeCost(V source, V target)?, num costEstimate(V vertex)?, StorageStrategy<V>? vertexStrategy}) → Path<V, num>?

Performs a search for the shortest path between source and target.

shortestPathAll(V source, Predicate1<V> targetPredicate, {num edgeCost(V source, V target)?, num costEstimate(V target)?, StorageStrategy<V>? vertexStrategy}) → Iterable<Path<V, num>>

Performs a search for the shortest paths between source and the targetPredicate predicate.