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.
11 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 'main'
${ noResults }
Go to file
josch 22c3e1b386 Merge pull request #3 from ldionne/pull_request 
Add the boost_hawick submodule.
 		11 years ago
abate@dfc003e4c0 update submodules 11 years ago
boost_hawick@0a1f810efa Add the boost_hawick submodule. 11 years ago
hawick@ba701d1979 update submodules 11 years ago
meyer@e666dad85a update submodules 11 years ago
networkx@169b7bce4d update submodules 11 years ago
papers add relevant papers 12 years ago
tarjan@91beb23e1f update submodules 11 years ago
.gitmodules Add the boost_hawick submodule. 11 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 Add the boost_hawick submodule. 11 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.