a package:fgl

Finds the articulation points for a connected undirected graph, by using the low numbers criteria: a) The root node is an articulation point iff it has two or more children. b) An non-root node v is an articulation point iff there exists at least one child w of v such that lowNumber(w) >= dfsNumber(v).

augmentGraph :: (DynGraph gr, Num b) => gr a b -> gr a (b, b, b)

fgl Data.Graph.Inductive.Query.MaxFlow

i                                  0
For each edge a--->b insert into graph the edge a<---b . Then change the
i         (i,0,i)
label of every edge from a---->b to a------->b

where label (x,y,z)=(Max Capacity, Current flow, Residual capacity)

apply :: GT m g a -> m g -> m (a, g)

fgl Data.Graph.Inductive.Query.Monad

apply' :: Monad m => GT m g a -> g -> m (a, g)

fgl Data.Graph.Inductive.Query.Monad

applyWith :: Monad m => (a -> b) -> GT m g a -> m g -> m (b, g)

fgl Data.Graph.Inductive.Query.Monad

applyWith' :: Monad m => (a -> b) -> GT m g a -> g -> m (b, g)

fgl Data.Graph.Inductive.Query.Monad

type Adj b = [(b, Node)]

fgl Data.Graph.Inductive.Graph

Labeled links to or from a Node.