Commit Graph

6 Commits

Author SHA1 Message Date
Dan Kortschak
6b03bc22e1 graph: use int64 for node retrieval 2018-03-24 09:21:44 +10:30
kortschak
fa0c5aa7bc all: use golang.org/x/exp/rand instead of math/rand 2017-11-17 11:52:34 +10:30
kortschak
805531d142 all: change capitalization of gonum in license header 2017-11-02 06:54:08 +10:30
kortschak
21d5891471 all: remove go1.7 build constraints 2017-10-27 13:48:47 +10:30
kortschak
1b3b29f16b graph/path: implement sophisticated algorithm
Both algorithms are included since the LTA appears to beat the SLTA for
all normal uses, but the SLTA beats the LTA for very large dense graphs.

Leave tools in the benchmark code to allow users to determine which one
they want to use for their data.
2017-09-12 09:50:52 +09:30
kortschak
9baf9959f7 graph/path: add benchmarks for Dominators
The initial test cases are from Robin Eklind's decomp project, the DOT
files were generated using his instructions:

    git clone https://github.com/decomp/testdata
    go get github.com/decomp/decomp/cmd/ll2dot
    cd testdata/pathological/testdata
    ll2dot *.ll
2017-09-12 09:50:52 +09:30