Module matching
gamma
Returns a greedy matching over all componenents of the Graph. Bipartate graphs always return a perfect Matching. Non-bipartate graphs yield either maximal or maximum Matchings.