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 0.1.0.0
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_ in.tum.de
Category Data Structures, Graphs
Uploaded by eberlm at Thu Nov 27 14:46:37 UTC 2014
Distributions NixOS:0.1.0.0
Downloads 1009 total (10 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

Modules

[Index]

Downloads

Maintainer's Corner

For package maintainers and hackage trustees