(a -> b) -> (a, a) -> (b, b) +fgl

(><) :: (a -> b) -> (c -> d) -> (a, c) -> (b, d)
fgl Data.Graph.Inductive.Query.Monad
mapSnd :: (a -> b) -> (c, a) -> (c, b)
fgl Data.Graph.Inductive.Query.Monad
mapFst :: (a -> b) -> (a, c) -> (b, c)
fgl Data.Graph.Inductive.Query.Monad
emap :: DynGraph gr => (b -> c) -> gr a b -> gr a c
fgl Data.Graph.Inductive.Graph
Map a function over the Edge labels in a graph.
nmap :: DynGraph gr => (a -> c) -> gr a b -> gr c b
fgl Data.Graph.Inductive.Graph
Map a function over the Node labels in a graph.
elfilter :: DynGraph gr => (b -> Bool) -> gr a b -> gr a b
fgl Data.Graph.Inductive.Basic
Filter based on edge label property.