You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Imagine you have to transfer N ants from A to B on an Ant Farm (a graph) in the fastest possible way. The program finds the best set of paths on a graph and does all the work!
I have done this one more time (in Java), so please read Lem-in V2 README instead.
About
Imagine you have to transfer N ants from A to B on an Ant Farm (a graph) in the fastest possible way. The program finds the best set of paths on a graph and does all the work!