@Test public void randomTest() { int N = 300; Random r = new Random(); for (int i = 5; i < N; i += r.nextInt(10)) { int v = r.nextInt(i) + i; Digraph G = DigraphGenerator.dag(v, r.nextInt(v * (v - 1) / 2)); Assert.assertEquals(expect(G), HamilitonianPathInDAG.solve(GraphConverter.convert(G))); } }
public static List<Integer> solve(Set<Integer>[] DAG) { return null; }
HamilitonianPathInDAG { public static List<Integer> solve(Set<Integer>[] DAG) { return null; } }
HamilitonianPathInDAG { public static List<Integer> solve(Set<Integer>[] DAG) { return null; }  }
HamilitonianPathInDAG { public static List<Integer> solve(Set<Integer>[] DAG) { return null; }  static List<Integer> solve(Set<Integer>[] DAG); }
HamilitonianPathInDAG { public static List<Integer> solve(Set<Integer>[] DAG) { return null; }  static List<Integer> solve(Set<Integer>[] DAG);  }