Skip to content

Finding non-intersecting paths in a large omnidirectional graph.

Notifications You must be signed in to change notification settings

Ahmad-Buglen/lemin

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

88 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Lem_in

Lem_in is a School 42 project.

The purpose of this project is to find paths from start room to end room and to move ants by these paths with the least amount of steps.

lem-in.en.pdf is the task file.

How to run program?

./lem-in < MAP_FILE

Install

Example

Examples

Example Example

About

Finding non-intersecting paths in a large omnidirectional graph.

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published