https://github.com/ollevche/lem-in

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!
https://github.com/ollevche/lem-in

Last synced: over 1 year ago
JSON representation

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!

• Host: GitHub
• URL: https://github.com/ollevche/lem-in
• Owner: ollevche
• License: mit
• Created: 2018-04-23T14:43:48.000Z (about 8 years ago)
• Default Branch: master
• Last Pushed: 2021-03-13T20:57:28.000Z (over 5 years ago)
• Last Synced: 2025-02-08T21:31:13.176Z (over 1 year ago)
• Language: C
• Homepage:
• Size: 131 KB
• Stars: 0
• Watchers: 0
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

          
## :ant: 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](https://github.com/ollevche/lem-in-v2) instead.