Graph structure with type parameters for nodes and edges

Version on this page:
LTS Haskell 22.29:0.0.4@rev:1
Stackage Nightly 2024-07-13:0.0.4@rev:1
Latest on Hackage:0.0.4@rev:1

See all snapshots comfort-graph appears in

BSD-3-Clause licensed by Henning Thielemann
Maintained by [email protected]
This version can be pinned in stack with:comfort-graph-,2979

Module documentation for

This graph structure is based on Data.Map and allows any Ord type for nodes and allows directed, undirected and more edge types. There is no need to map nodes to integer numbers. This makes handling in applications much more comfortable, thus the package name.

Currently the package does not contain any advanced algorithm, just the data structure and some manipulation functions.

The edge type can be freely chosen. This allows great flexibility but it is a bit more cumbersome to do in Haskell 98. Examples of edge types:

  • DirEdge: Edges in a directed graph

  • UndirEdge: Edges in an undirected graph

  • EitherEdge: For graphs containing both directed and undirected edges

  • You may define an edge type with an additional identifier in order to support multiple edges between the same pair of nodes.

  • Using type functions on the node type you may even define an edge type for nodes from a Cartesian product, where only "horizontal" and "vertical" edges are allowed.

For examples see the linear-circuit package and its tests. The ResistorCube test demonstrates non-integer node types and the Tree test demonstrates multigraphs.

The package is plain Haskell 98.

Related packages:

  • fgl: standard package for graph processing with many graph algorithms but cumbersome data structure with Int numbered nodes