Go program that implements max flow and Dijkstra's algorithms to find the fastest way to move N amount of ants from the room A to the room B aka solve ants colony optimization problem
-
Updated
Dec 29, 2020 - Go
Go program that implements max flow and Dijkstra's algorithms to find the fastest way to move N amount of ants from the room A to the room B aka solve ants colony optimization problem
Flow network solver implemented in Go; handles max-flow and circulations with node and edge demands via a push-relabel algorithm.
Add a description, image, and links to the max-flow topic page so that developers can more easily learn about it.
To associate your repository with the max-flow topic, visit your repo's landing page and select "manage topics."