@Test public void napthalene_augment() throws Exception { Graph g = Graph.fromSmiles("C1C=CC2=CCC=CC2=C1"); Matching m = Matching.empty(g); m.match(1, 2); m.match(3, 4); m.match(6, 7); m.match(8, 9); MaximumMatching.maximise(g, m, 8); assertThat(m.matches(), hasItems(Tuple.of(0, 1), Tuple.of(2, 3), Tuple.of(4, 5), Tuple.of(6, 7), Tuple.of(8, 9))); }
static int maximise(Graph g, Matching m, int n, IntSet s) { MaximumMatching mm = new MaximumMatching(g, m, n, s); return mm.nMatched; }
MaximumMatching { static int maximise(Graph g, Matching m, int n, IntSet s) { MaximumMatching mm = new MaximumMatching(g, m, n, s); return mm.nMatched; } }
MaximumMatching { static int maximise(Graph g, Matching m, int n, IntSet s) { MaximumMatching mm = new MaximumMatching(g, m, n, s); return mm.nMatched; } private  MaximumMatching(Graph graph, Matching matching, int nMatched, IntSet subset); }
MaximumMatching { static int maximise(Graph g, Matching m, int n, IntSet s) { MaximumMatching mm = new MaximumMatching(g, m, n, s); return mm.nMatched; } private  MaximumMatching(Graph graph, Matching matching, int nMatched, IntSet subset);  }
MaximumMatching { static int maximise(Graph g, Matching m, int n, IntSet s) { MaximumMatching mm = new MaximumMatching(g, m, n, s); return mm.nMatched; } private  MaximumMatching(Graph graph, Matching matching, int nMatched, IntSet subset);   }