search

kalexmills / flownet

Flow network solver implemented in Go; handles max-flow and circulations with node and edge demands via a push-relabel algorithm.
MIT License
2 stars 1 forks source link

TODO: use adjacency list #2

Closed kalexmills closed 3 years ago

kalexmills commented 3 years ago

Now that we have an adjacency list, it should be used to speed up iterations wherever possible.

kalexmills commented 3 years ago

Closed by #3