Skip to content

HORIZON HASKELL Docs lts/ghc-10.0.x2b276322026-10-31Search packagesCtrl K

Theme: |

GHC 10.0.0.20260917 · lts/ghc-10.0.x · 2b27632 · 2026-10-31

Modulecabal-install-solver-3.18.1.0Haskell2010

Distribution.Solver.Modular.LabeledGraph

Wrapper around Data.Graph with support for edge labels

Contents

Graphs
Building graphs
Graph properties
Operations on the underlying unlabeled graph

Synopsis

type Graph
type Vertex
value graphFromEdges
value graphFromEdges'
value buildG
value transposeG
value vertices
value edges
value forgetLabels
value topSort

Packagecabal-install-solver-3.18.1.0
Exports10
LanguageHaskell2010
LicenceBSD-3-Clause
SourceLabeledGraph.hs

Graphs

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

typetype Vertex = Int

Abstract representation of vertices.

Building graphs

valuegraphFromEdges

:: 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

valuegraphFromEdges'

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

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

valuetransposeG :: Graph e -> Graph e

Graph properties

valuevertices :: Graph e -> [Vertex]

valueedges :: Graph e -> [Edge e]

Operations on the underlying unlabeled graph

valueforgetLabels :: Graph e -> Graph

valuetopSort :: Graph e -> [Vertex]