Maximum Matchings of a Digraph Based on the Largest Geometric Multiplicity

Figure 1

A digraph with six nodes and six edges.