Skip to content

Sarmerer/lem-in

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

46 Commits
cmd
cmd
 
 
config
config
 
 
maps
maps
 
 
parser
parser
 
 
solver
solver
 
 
types
types
 
 
utils
utils
 
 
.gitignore
.gitignore
 
 
go.mod
go.mod
 
 
go.sum
go.sum
 
 

About

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

Topics

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

Stars

1 star

Watchers

1 watching

Forks

1 fork
Report repository

Releases

No releases published

Packages

 
 
 

Contributors

Languages