cycle_test

No description

Find a file

josch 22c3e1b386 Merge pull request #3 from ldionne/pull_request Add the boost_hawick submodule.		2013-04-11 12:57:35 -07:00
abate@dfc003e4c0	update submodules	2013-04-11 10:30:58 +02:00
boost_hawick@0a1f810efa	Add the boost_hawick submodule.	2013-04-11 15:30:13 -04:00
hawick@ba701d1979	update submodules	2013-04-11 10:30:58 +02:00
meyer@e666dad85a	update submodules	2013-04-11 10:30:58 +02:00
networkx@169b7bce4d	update submodules	2013-04-11 10:30:58 +02:00
papers	add relevant papers	2012-07-04 14:27:24 +02:00
tarjan@91beb23e1f	update submodules	2013-04-11 10:30:58 +02:00
.gitmodules	Add the boost_hawick submodule.	2013-04-11 15:30:13 -04: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	Add the boost_hawick submodule.	2013-04-11 15:30:13 -04: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.