Graph -package

module Data.Graph
containers Data.Graph
A version of the graph algorithms described in: Lazy Depth-First Search and Linear Graph Algorithms in Haskell, by David King and John Launchbury.
module Data.Graph.Inductive.Graph
fgl Data.Graph.Inductive.Graph
Static and Dynamic Inductive Graphs
module Data.Graph.Inductive.Graphviz
fgl Data.Graph.Inductive.Graphviz
Simple graphviz output.
class Graph gr
fgl Data.Graph.Inductive.Graph
Minimum implementation: empty, isEmpty, match, mkGraph, labNodes
type Graph = Table [Vertex]
containers Data.Graph
Adjacency list representation of a graph, mapping each vertex to its list of successors.
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
graphFromEdges :: Ord key => [(node, key, [key])] -> (Graph, Vertex -> (node, key, [key]), key -> Maybe Vertex)
containers Data.Graph
Build a graph from a list of nodes uniquely identified by keys, with a list of keys of nodes this node should have edges to. The out-list may contain keys that don't correspond to nodes of the graph; they are ignored.
graphFromEdges' :: Ord key => [(node, key, [key])] -> (Graph, Vertex -> (node, key, [key]))
containers Data.Graph
Identical to graphFromEdges, except that the return value does not include the function which maps keys to vertices. This version of graphFromEdges is for backwards compatibility.
class Monad m => GraphM m gr
fgl Data.Graph.Inductive.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
type GraphRep a b = (Int, Array Node (Context' a b), IOArray Node Bool)
fgl Data.Graph.Inductive.Monad.IOArray
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.

Show more results