GitHub - FowlingLight/Lem-in: A simple algorithm to find the shortest path in a graph

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 1 Commits
.svn		.svn
lib		lib
Makefile		Makefile
README		README
aff.c		aff.c
check_file.c		check_file.c
checks.c		checks.c
get_all.c		get_all.c
get_graph.c		get_graph.c
get_graph2.c		get_graph2.c
go_ants.c		go_ants.c
graph		graph
graph1		graph1
graph2		graph2
init.c		init.c
lem_in		lem_in
lem_in.c		lem_in.c
lem_in2.c		lem_in2.c
line		line
my.h		my.h
my_free.c		my_free.c
pipe		pipe
skips.c		skips.c
utils.c		utils.c

Repository files navigation

Lanch the program using './lem-in < file'

The program will diplay the file used and show the path by moving ants on it. Each node can only contain one ant, so the ouptup will be P1-2, saying that an ant is moving from the node 1 to the node 2

You can create a graph using the following format:
number_of_ants
node1 x y
##start //stating that the following node is the start of the graph
node2 x y
#comment
##end
node3 x y //stating that the following node is the end of the graph
node1-node2 //indicating a connection between these nodes
node2-node3

To put a comment in the file, you need to use #, not //
The // are only used here to add additionnal information