graph_walking: uses a modified version of the graph walking example in the README. The main modification is that the generation of input facts doesn't use rand any more in order to keep the inputs the same
fibonacci uses the code from the Fibonacci test case and adds a configurable n parameter, also increasing the width of the number type
I integrated this into #9 and was a bit eager to make a PR for this. It's probably still useful because this works on master, but I'll close this for now.
This PR adds two benchmarks:
graph_walking
: uses a modified version of the graph walking example in the README. The main modification is that the generation of input facts doesn't userand
any more in order to keep the inputs the samefibonacci
uses the code from the Fibonacci test case and adds a configurablen
parameter, also increasing the width of the number type