Hoogle Search

Within LTS Haskell 24.41 (ghc-9.10.3)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

Exact lookup

1. type NodeMapM a b (g :: Type -> Type -> Type) r = State (NodeMap a, g a b) r

   fgl	Data.Graph.Inductive.NodeMap

   Graph construction monad; handles passing both the NodeMap and the Graph.

2. delMapEdge :: (Ord a, DynGraph g) => NodeMap a -> (a, a) -> g a b -> g a b

   fgl	Data.Graph.Inductive.NodeMap

   Partial function: raises exception if passed nodes that are not in the graph.

3. delMapEdgeM :: (Ord a, DynGraph g) => (a, a) -> NodeMapM a b g ()

   fgl	Data.Graph.Inductive.NodeMap

   No documentation available.

4. delMapEdges :: (Ord a, DynGraph g) => NodeMap a -> [(a, a)] -> g a b -> g a b

   fgl	Data.Graph.Inductive.NodeMap

   Partial function: raises exception if passed nodes that are not in the graph.

5. delMapEdgesM :: (Ord a, DynGraph g) => [(a, a)] -> NodeMapM a b g ()

   fgl	Data.Graph.Inductive.NodeMap

   No documentation available.

6. delMapNode :: (Ord a, DynGraph g) => NodeMap a -> a -> g a b -> g a b

   fgl	Data.Graph.Inductive.NodeMap

   No documentation available.

7. delMapNodeM :: (Ord a, DynGraph g) => a -> NodeMapM a b g ()

   fgl	Data.Graph.Inductive.NodeMap

   No documentation available.

8. delMapNodes :: (Ord a, DynGraph g) => NodeMap a -> [a] -> g a b -> g a b

   fgl	Data.Graph.Inductive.NodeMap

   No documentation available.

9. delMapNodesM :: (Ord a, DynGraph g) => [a] -> NodeMapM a b g ()

   fgl	Data.Graph.Inductive.NodeMap

   No documentation available.

10. insMapEdge :: (Ord a, DynGraph g) => NodeMap a -> (a, a, b) -> g a b -> g a b

    fgl	Data.Graph.Inductive.NodeMap

    Partial function: raises exception if passed nodes that are not in the graph.

Page 508 of many | Previous | Next