graph-matchings: An implementation of algorithms for matchings in graphs

[ 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.

Versions [RSS] [faq]
Dependencies base (>=3 && <5), containers (==0.5.*), fgl (>=5.4 && <5.6) [details]
License LGPL-2.1-only
Author Manuel Eberl
Maintainer last name + m _at_
Category Data Structures, Graphs
Uploaded by eberlm at 2014-11-27T14:46:37Z
Distributions NixOS:
Downloads 1573 total (9 in the last 30 days)
Rating 2.0 (votes: 1) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Hackage Matrix CI
Docs uploaded by user
Build status unknown [no reports yet]




Maintainer's Corner

For package maintainers and hackage trustees