The graph-matchings package

[ Tags: data-structures, graphs, lgpl, library ] [ Propose Tags ]

This package provides algorithms on matchings in graphs; in particular, determining whether a given set of edges is a (maximalmaximum) matching and finding maximalmaximum matchings.


Dependencies base (>=3 && <5), containers (==0.5.*), fgl (>=5.4 && <5.6) [details]
License LGPL-2.1
Author Manuel Eberl
Maintainer last name + m _at_
Category Data Structures, Graphs
Uploaded Thu Nov 27 14:46:37 UTC 2014 by eberlm
Distributions NixOS:
Downloads 911 total (15 in the last 30 days)
Rating 2.0 (votes: 1) [estimated by rule of succession]
Your Rating
  • λ
  • λ
  • λ
Status Docs uploaded by user
Build status unknown [no reports yet]
Hackage Matrix CI




Maintainer's Corner

For package maintainers and hackage trustees