README.md

### Ford-Fulkerson (BFS-based aka Edmonds-Karp)

Computes a maximum flow given a weighted directed graph. Uses the scaling variant of Edmonds-Karp for stronger polynomial bounds (c.f.

*Network Flows*by Ahuja, et al.).{"start": <start ID>, "end": <end ID>, "capacity": <integer>}

Returns as output a dictionary with keys "flow", an integer denoting the total flow, and "edges", a list of edges in the form:

{"start": <start ID>, "end": <end ID>, "flow": <integer>}