Adithya Kumar

Optimum Path Algorithms for Labelled.AdjacencyMap.Algorithm

2

Added shortest path algorithm for a general labeled graph.

Labelled acyclic graph and optimum path algorithm + Additional changes

20

This is a draft implementation of labeled acyclic graph required if one wants to make algorithms on acyclic graphs. There is still a lot of work to be done including...

Significant: ``` Generating reports for Data.Fold... Data.Fold(cpuTime) Benchmark default(0)(ns) default(1) - default(0)(%) ---------------------------------------------------------------------------- -------------- -------------------------- All.Data.Fold/o-1-space.elimination.top 1417280.00 +83.33 All.Data.Fold/o-1-space.elimination.bottom 120955.00 +68.90 Generating reports for FileSystem.Handle... FileSystem.Handle(cpuTime) Benchmark default(0)(ms) default(1) -...

GHC 9.0.2 in the CI fails with `base_GHCziRead_list3_closure` symbol not being resolved. The error was bypassed hackily by ignoring the linker warnings. `ghc-options: -optlm "--unresolved-symbols=ignore-all"` zdecode `base_GHCziRead_list3_closure` == `base_GHC.Read_list3_closure` See:...

- `byteLength` vs `length` - Pass as tuple vs curry

Treat the `n` as number of elements instead of number of bytes.

Convert the Ring and Array to streams and compare. Check performance accordingly.