graph

graph / JEdmondsKarpMaximumFlow / 0.1.0

README.md

Computes maximum flow in a network using Edmonds-Karp algorithm.

Inputs:
  • A graph represented as a map from vertices (strings) to a list of neighbors (list of strings) OR the url to the Data API file that holds the graph that you would like to be read (currently supported formats: GML)