fgl
fgl copied to clipboard
haskell
A Functional Graph Library for Haskell
This adds support for GHC 9.4, where ST is no longer an instance of MonadFail. The two instances of GraphM that are predefined in fgl are ST and IO, and...
`fgl` fails to compile with GHC 9.4 because `ST` is no longer an instance of MonadFail: https://github.com/haskell/core-libraries-committee/issues/33 I am trying to work out the best way to fix it. One...
Currently the dom function returns *all* nodes whether they are reachable or not. This change restricts the dominator search to only those nodes reachable from the provided root.
``` -- | Pretty-print the graph. Note that this loses a lot of -- information, such as edge inverses, etc. prettify :: (DynGraph gr, Show a, Show b) => gr...
This is a try to fix #72 . The main new function is `mkLookupNode`, which is `mkNode` plus a Boolean saying if the node was already present. I also added...
`NodeMap` only allows insertion of nodes with automatic duplicate prevention. It does not support checking whether a node exists or reporting whether `mkNode` actually created a new node, though this...
The `insMapEdge` family of functions are partial, and will crash when you try to add an edge where one of the nodes doesn't exist in the graph. This doesn't appear...
Functions that rely on `match` and also take a function involving `Context` show expected, but poorly documented behavior. The issue comes up when user functions that are supposed to operate...
Hello! I tried to use `gsel` to find "start nodes", i.e. nodes to which have no edges point. However, `gsel` seems to treat all "Contexts" as if no edges point...
