Flow network solver implemented in Go; handles max-flow and circulations with node and edge demands via a push-relabel algorithm.

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