graph-matchings

An implementation of algorithms for matchings in graphs

Latest on Hackage:0.1.0.0

This package is not currently in any snapshots. If you're interested in using it, we recommend adding it to Stackage Nightly. Doing so will make builds more reliable, and allow stackage.org to host generated Haddocks.

LGPL-2.1 licensed by Manuel Eberl
Maintained by last name + m _at_ in.tum.de

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.

Depends on:
Used by 1 package:
comments powered byDisqus