Benchmarking MWM in Incomplete Graphs

As expected, a maximum matching is found more quickly in a graph with fewer edges.

Using max_cardinality = true.