The UMinho Haskell Libraries contain support for representing and operating on relations (=graphs).

For a snapshot see:

The following is included:

  • Representation of relations as sets of pairs.
  • Representation of labeled relations as finite maps.
  • Closure operations (reflexive, symmetric, transitive).
  • Slicing operators (forward, backward, chopping).
  • Graph integration.
  • Generic extremal path algorithm and its instances (reachability, least cost, bottle neck).
  • Formal Concept Analysis (FCA).
  • Computation of connected components.