GitHub - 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

Sarmerer / lem-in Public

Notifications
Fork 1
Star 1

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

1 star 1 fork Branches Tags Activity

Star

Notifications

Branches Tags

Name		Name	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

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

Activity

1 star

1 watching

1 fork

Report repository