Graph +fgl

module Data.Graph.Inductive.Graph
fgl Data.Graph.Inductive.Graph
Static and Dynamic Inductive Graphs
class Graph gr
fgl Data.Graph.Inductive.Graph
Minimum implementation: empty, isEmpty, match, mkGraph, labNodes
module Data.Graph.Inductive.Graphviz
fgl Data.Graph.Inductive.Graphviz
Simple graphviz output.
class Monad m => GraphM m gr
fgl Data.Graph.Inductive.Monad
type GraphRep a b = (Int, Array Node (Context' a b), IOArray Node Bool)
fgl Data.Graph.Inductive.Monad.IOArray
graphDff :: GraphM m gr => [Node] -> m (gr a b) -> m [Tree Node]
fgl Data.Graph.Inductive.Query.Monad
graphDff' :: GraphM m gr => m (gr a b) -> m [Tree Node]
fgl Data.Graph.Inductive.Query.Monad
graphFilter :: GraphM m gr => (Context a b -> Bool) -> m (gr a b) -> m [Context a b]
fgl Data.Graph.Inductive.Query.Monad
graphFilterM :: GraphM m gr => (Context a b -> Bool) -> GT m (gr a b) [Context a b]
fgl Data.Graph.Inductive.Query.Monad
graphNodes :: GraphM m gr => m (gr a b) -> m [Node]
fgl Data.Graph.Inductive.Query.Monad
graphNodesM :: GraphM m gr => GT m (gr a b) [Node]
fgl Data.Graph.Inductive.Query.Monad
graphNodesM0 :: GraphM m gr => GT m (gr a b) [Node]
fgl Data.Graph.Inductive.Query.Monad
graphRec :: GraphM m gr => GT m (gr a b) c -> (c -> d -> d) -> d -> GT m (gr a b) d
fgl Data.Graph.Inductive.Query.Monad
encapsulates a simple recursion schema on graphs
graphRec' :: (Graph gr, GraphM m gr) => GT m (gr a b) c -> (c -> d -> d) -> d -> GT m (gr a b) d
fgl Data.Graph.Inductive.Query.Monad
graphUFold :: GraphM m gr => (Context a b -> c -> c) -> c -> GT m (gr a b) c
fgl Data.Graph.Inductive.Query.Monad
graphviz :: (Graph g, Show a, Show b) => g a b -> String -> (Double, Double) -> (Int, Int) -> Orient -> String
fgl Data.Graph.Inductive.Graphviz
Formats a graph for use in graphviz.
graphviz' :: (Graph g, Show a, Show b) => g a b -> String
fgl Data.Graph.Inductive.Graphviz
Format a graph for graphviz with reasonable defaults: title of "fgl", 8.5x11 pages, one page, landscape orientation
augmentGraph :: (DynGraph gr, Num b, Ord 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
defaultGraphSize :: Int
fgl Data.Graph.Inductive.Monad.IOArray
class Graph gr => DynGraph gr
fgl Data.Graph.Inductive.Graph

Show more results