graphs

graphs copied to clipboard

add dynamic-graphs benchmarks

1

dynamic-graphs is a new library for dynamic connectivity: https://github.com/alang9/dynamic-graphs https://hackage.haskell.org/package/dynamic-graphs (introductory blogpost: https://jaspervdj.be/posts/2019-01-11-dynamic-graphs.html ) It would be interesting to compare the performance of the reachability query.

ocramz

Add option for machine readable output.

5

It would be great to have a way to get runtime results as csv to feed it into scripts and whatnot.

AndreasPK

Clarification about memory benchmarks.

1

I think "space" and "data size" could use one more sentence to explain what they actually benchmark. For example I would have expected space to measure maximum memory usage not...

AndreasPK

Interest in other graph libraries

7

Thanks for this - graph library performance is definitely not obvious. Do you have any interest in additional graph libraries to examine? I was a bit frustrated with fgl performance...

travitch

Select right arguments to test functions

6

Currently, a function like `hasEdge` is tested with arguments from `take 2 edgesNotInGraph`. But this take the two _first_ edges not in the graphs, likely `(0,0)` and `(0,1)`. This is...

nobrakal