fgl
fgl copied to clipboard
haskell
A Functional Graph Library for Haskell
The original paper discusses an inductive `Graph` implementation based on "version tree" based arrays. I believe this was implemented in ML. Has there been any attempt to compare the performance...
Is there a some canonical way to enforce graph invariants in FGL? I have been using FGL to implement a generalization of graphs that allows for arbitrary arity and nesting...
In the case of vertices representing cities and edges representing roads. There are multiple edges between cities representing different route possibilities. Shortest path just gives me a list of nodes...
Is there any chance that `numNodes` could be added as a synonym for `noNodes` (and perhaps `noNodes` deprecated)? `noNodes` really looks like "no nodes" and intuitively seems to suggest a...
It would be handy for the documentation to confirm the expected time and space complexity of the functions in `fgl`. Given that all the functions operate over instances of `Graph`...
I believe we should offer ``` haskell freezeGraph :: (GraphM m mg, Graph g) => mg a b -> m (g a b) thawGraph :: (GraphM m mg, Graph g)...
It should be possible to unify the `IO` and `ST` support, and indeed expand support to other `PrimMonad` instances.
They are not even remotely legitimate and there should never be any reason to use them. IMO, they should be removed promptly in the next major version.
`Data.Graph.Inductive.Internal.Queue` isn't efficient for persistent use. It would be easier to ensure that it's not accidentally used persistently if it's given a monadic interface. It should probably also be benchmarked...
Some `RULES` pragmas are used to specialize functions to specific graph implementations. I believe most or all of these could be eliminated by adding the relevant functions to `Graph` or...