Distribution.Solver.Modular.LabeledGraph

Wrapper around Data.Graph with support for edge labels

Graphs

type Graph e = Array Vertex [(e, Vertex)]

type Vertex = Int

Abstract representation of vertices.

Building graphs

graphFromEdges :: forall key node edge. Ord key => [(node, key, [(edge, key)])] -> (Graph edge, Vertex -> (node, key, [(edge, key)]), key -> Maybe Vertex)

Construct an edge-labeled graph

This is a simple adaptation of the definition in Data.Graph

graphFromEdges' :: Ord key => [(node, key, [(edge, key)])] -> (Graph edge, Vertex -> (node, key, [(edge, key)]))

buildG :: Bounds -> [Edge e] -> Graph e

transposeG :: Graph e -> Graph e

Graph properties

vertices :: Graph e -> [Vertex]

edges :: Graph e -> [Edge e]

Operations on the underlying unlabeled graph

forgetLabels :: Graph e -> Graph

topSort :: Graph e -> [Vertex]