cycle_test

No description

Find a file

josch 90dd415786 feed algorithms by standard input instead of argv		2013-04-11 10:28:15 +02:00
abate@97c52244e1	add submodules	2012-07-04 14:34:10 +02:00
hawick@05d80f20f8	add submodules	2012-07-04 14:34:10 +02:00
meyer@d30df0e98c	add submodules	2012-07-04 14:34:10 +02:00
networkx@d6a0832864	clone networkx	2013-03-01 16:55:04 +01:00
papers	add relevant papers	2012-07-04 14:27:24 +02:00
tarjan@ecc6296d85	add submodules	2012-07-04 14:34:10 +02:00
.gitmodules	add networkx submodule	2013-03-01 16:51:22 +01:00
_tags	initial commit	2012-07-04 14:23:50 +02:00
Makefile	initial commit	2012-07-04 14:23:50 +02:00
rand_graph.ml	properly calculate boundaries for amount of vertices/edges	2012-07-04 18:32:10 +02:00
README.md	initial commit	2012-07-04 14:23:50 +02:00
test.sh	feed algorithms by standard input instead of argv	2013-04-11 10:28:15 +02:00

Run cycle enumerating code on sample input and compare results

An ocaml script generates random directed graphs with loops.

Those loops are fed to a number of different cycle enumeration algorithms.

The outputs are compared with each other to ensure correct execution.

git submodule update --init

./test.sh 11

The argument to the shell script is an integer denoting the maximum number of vertices for which graphs will be generated.