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

This is a package candidate release! Here you can preview how this package release will appear once published to the main package index (which can be accomplished via the 'maintain' link below). Please note that once a package has been published to the main package index it cannot be undone! Please consult the package uploading documentation for more information.

[maintain] [Publish]

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.

Properties

Versions 0.1.0.0, 0.1.0.0
Change log None available
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 2014-11-27T14:46:10Z

Modules

[Index]

Downloads

Maintainer's Corner

For package maintainers and hackage trustees