@Test public void randomTest() { int N = 2; for (int i = 0; i < 80; i++) { if (i % 10 == 9) { N <<= 1; } EdgeWeightedGraph graph = WeightedGraphBuilder.buildRandomGraph(N); Set<Edge> test = MinWeightFeedbackEdgeSet.solve(graph); EdgeWeightedGraph reverseWeight = new EdgeWeightedGraph(graph.V()); Map<Edge, Edge> map = new HashMap<>(); for (Edge e : graph.edges()) { Edge rev = new Edge(e.either(), e.other(e.either()), -e.weight()); reverseWeight.addEdge(rev); map.put(rev, e); } PrimMST mst = new PrimMST(reverseWeight); Set<Edge> expect = new HashSet<>(); mst.edges().forEach(expect::add); for (Map.Entry<Edge, Edge> entry : map.entrySet()) { Assert.assertEquals(!expect.contains(entry.getKey()), test.contains(entry.getValue())); } } }
public static Set<Edge> solve(EdgeWeightedGraph graph) { return null; }
MinWeightFeedbackEdgeSet { public static Set<Edge> solve(EdgeWeightedGraph graph) { return null; } }
MinWeightFeedbackEdgeSet { public static Set<Edge> solve(EdgeWeightedGraph graph) { return null; }  }
MinWeightFeedbackEdgeSet { public static Set<Edge> solve(EdgeWeightedGraph graph) { return null; }  static Set<Edge> solve(EdgeWeightedGraph graph); }
MinWeightFeedbackEdgeSet { public static Set<Edge> solve(EdgeWeightedGraph graph) { return null; }  static Set<Edge> solve(EdgeWeightedGraph graph);  }