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

[ data-structures, graphs, lgpl, library ] [ Propose Tags ] [ Report a vulnerability ]

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.

Modules

Data
- Graph
  - Inductive
    - Query
      - Data.Graph.Inductive.Query.Matchings

Downloads

graph-matchings-0.1.0.0.tar.gz [browse] (Cabal source package)
Package description (as included in the package)

Maintainer's Corner

Package maintainers

eberlm

For package maintainers and hackage trustees

edit package information

Candidates

0.1.0.0

Versions [RSS]	0.1.0.0
Dependencies	base (>=3 && <5), containers (>=0.5 && <0.6), 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:37Z
Distributions
Reverse Dependencies	1 direct, 0 indirect [details]
Downloads	1759 total (1 in the last 30 days)
Rating	2.0 (votes: 1) [estimated by Bayesian average]
Your Rating	λ λ λ
Status	Docs uploaded by user Build status unknown [no reports yet]