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

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

ant-colony-optimization dijkstra-algorithm go max-flow

Last synced: 17 days ago
JSON representation

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

• Host: GitHub
• URL: https://github.com/Sarmerer/lem-in
• Owner: Sarmerer
• Created: 2020-12-29T01:40:12.000Z (about 4 years ago)
• Default Branch: master
• Last Pushed: 2020-12-29T01:41:14.000Z (about 4 years ago)
• Last Synced: 2024-09-01T19:30:51.628Z (4 months ago)
• Topics: ant-colony-optimization, dijkstra-algorithm, go, max-flow
• Language: Go
• Homepage:
• Size: 9.27 MB
• Stars: 1
• Watchers: 1
• Forks: 1
• Open Issues: 0
• Metadata Files:

Awesome Lists containing this project

• awesome-golang-repositories - lem-in