comfort-graph: Graph structure with type parameters for nodes and edges

This is a package candidate release! Here you can preview how this package release will appear once published to the main package index (which can be accomplished via the 'maintain' link below). Please note that once a package has been published to the main package index it cannot be undone! Please consult the package uploading documentation for more information.


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:

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:


Versions0.0,,,, 0.0.1, 0.0.2,,, 0.0.3
Change logNone available
Dependenciesbase (>=4.5 && <5), containers (>=0.4 && <0.6), QuickCheck (>=2.5 && <3), transformers (==0.5.*), utility-ht (>=0.0.10 && <0.1) [details]
AuthorHenning Thielemann
Home page
Source repositorythis: darcs clone --tag
head: darcs clone
UploadedWed Nov 8 09:34:27 UTC 2017 by HenningThielemann




Maintainers' corner

For package maintainers and hackage trustees