Code for maximum-flow and two of its more interesting variants, circulations and transshipments.
-
Notifications
You must be signed in to change notification settings - Fork 1
Flow network solver implemented in Go; handles max-flow and circulations with node and edge demands via a push-relabel algorithm.
License
kalexmills/flownet
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Flow network solver implemented in Go; handles max-flow and circulations with node and edge demands via a push-relabel algorithm.
Topics
Resources
License
Stars
Watchers
Forks
Packages 0
No packages published