Skip to content

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!

License

Notifications You must be signed in to change notification settings

ollevche/lem-in

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

77 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

🐜 Lem-in

This is C implementation of Lem-in.

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!

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published