Home
Publications
In the News

Events

GTTSE 2009
SQM 2009

Tools

2LT
CoddFish
XsdMetz
SdfMetz
MatchO

Strafunski

Related

Software Product Certification
Research at SIG


TFM Seminar
TFM group pages
PURé Café
PURe Project






www.flickr.com
This is a Flickr badge showing public photos from JstVssr. Make your own badge here.

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.

r4 - 14 Jun 2006 - 22:29:37 - JoostVisser
This site is powered by the TWiki collaboration platform Copyright © by the contributing authors. Ideas, requests, problems? Send feedback.
Syndicate this site RSSATOM