The graph-matchings package

[maintain]

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

Versions0.1.0.0, 0.1.0.0
Dependenciesbase (>=3 && <5), containers (==0.5.*), fgl (>=5.4 && <5.6) [details]
LicenseLGPL-2.1
AuthorManuel Eberl
Maintainerlast name + m _at_ in.tum.de
CategoryData Structures, Graphs
UploadedThu Nov 27 14:46:10 UTC 2014 by eberlm

Modules

[Index]

Downloads

Maintainers' corner

For package maintainers and hackage trustees