Pastel
PastelSys
Algorithms
Graph algorithms
Graph matching

Graph matching

A matching in a directed graph $G = (V, E)$ , where $E subset V^2$ , is a subset $M sub E$ , such that the edges in $M$ do not share vertices. A maximal matching in $G$ is a matching $M$ in $G$ which is not a proper subset of another matching in $G$ . A maximum matching in $G$ is a matching $M$ in $G$ of maximum cardinality $|M|$ .

Files

Graph matching

Files

Graph matching module

Maximum bipartite matching

Testing for maximum bipartite matching

maximum_bipartite_matching