Graph/edmonds_karp library

Functions

edmondsKarp<T>(Map<T, Map<T, num>> capacity, T source, T sink) num
Edmonds-Karp Algorithm for Maximum Flow in a directed graph.