hash-graph
hash-graph copied to clipboard
patrickdoc
A hashing-based graph implementation in Haskell
Hi, I am trying to implement `transpose` (the function that invert all the edges of the graph) for my benchmarks. I made: ```Haskell transpose :: Gr () Int -> Gr...
Hi, I want to benchmark `hash-graph` for the 2018 Google Summer of Code and I need to construct edges with `Edge`. ```Haskell data Edge a b = Edge !b !a...
Hi Patrick, nice library. Would you consider uploading your library to Hackage? This would make it a lot easier for others to use it. Best, Sven
From Reddit: > Does this support finding all possible paths between two specific nodes, where each edge is represented by a Money.ExchangeRate src dst? I.e. can I use arbitrary types...
`HM.fromList` offers a significant speedup over `foldl' insert`. I need to find an efficient way to convert from the user interface of `Edge n1 label n2` to each node paired...
The half edge type benefits greatly from unpacking on smaller types. ```haskell data Head a b = Head !a !b data SmallHead = SmallHead !Char !Int ``` Due to `-funbox-small-strict-fields`,...