code: static Matching maxamise(Matching matching, int[][] graph, BitSet subset) {
          new EdmondsMaximumMatching(graph, matching, subset);
          return matching;
      }
docs: Attempt to maximise the provided matching over a subset of vertices in a
  graph.
  
  @param matching the independent edge set to maximise
  @param graph    adjacency list graph representation
  @param subset   subset of vertices
  @return the matching