josch
/
cycle_test
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity
You cannot select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
4 Commits
1 Branch
0 Tags
3.2 MiB
Shell 78.2%
OCaml 15.7%
Makefile 6.1%
 
 
 
main
Branches Tags
${ item.name }
Create tag ${ searchTerm }
Create branch ${ searchTerm }
from 'db5fb580ed'
${ noResults }
Go to file
josch db5fb580ed properly calculate boundaries for amount of vertices/edges 12 years ago
abate@97c52244e1 add submodules 12 years ago
hawick@05d80f20f8 add submodules 12 years ago
meyer@d30df0e98c add submodules 12 years ago
papers add relevant papers 12 years ago
tarjan@ecc6296d85 add submodules 12 years ago
.gitmodules initial commit 12 years ago
Makefile initial commit 12 years ago
README.md initial commit 12 years ago
_tags initial commit 12 years ago
rand_graph.ml properly calculate boundaries for amount of vertices/edges 12 years ago
test.sh initial commit 12 years ago

README.md

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.

Setup

git submodule update --init

Usage

./test.sh 11

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