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

[ bsd3, data, library ] [ Propose Tags ]

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:

Versions 0.0, 0.0.0.1, 0.0.0.2, 0.0.0.3, 0.0.1, 0.0.2, 0.0.2.1, 0.0.3, 0.0.3.1
Dependencies base (>=4.5 && <5), containers (>=0.4 && <0.7), QuickCheck (>=2.5 && <3), semigroups (>=0.1 && <1.0), transformers (==0.5.*), utility-ht (>=0.0.10 && <0.1) [details]
License BSD-3-Clause
Author Henning Thielemann
Maintainer haskell@henning-thielemann.de
Category Data
Home page http://hub.darcs.net/thielema/comfort-graph
Source repo this: darcs get http://hub.darcs.net/thielema/comfort-graph --tag 0.0.3.1
head: darcs get http://hub.darcs.net/thielema/comfort-graph
Uploaded by HenningThielemann at Fri Aug 31 16:11:18 UTC 2018
Distributions LTSHaskell:0.0.3.1, NixOS:0.0.3.1, Stackage:0.0.3.1
Downloads 1879 total (69 in the last 30 days)
Rating (no votes yet) [estimated by rule of succession]
Your Rating
  • λ
  • λ
  • λ
Status Docs available [build log]
Last success reported on 2018-08-31 [all 1 reports]
Hackage Matrix CI

Modules

[Index] [Quick Jump]

Downloads

Maintainer's Corner

For package maintainers and hackage trustees