Function test2

code/graph/dinic.test.cpp:28–49

}

void test2() {
  int N = 20;
  int MAX = 100000;

  flow_network mf(N);
  ek::flow_network mf2(N);

  for(int i = 0; i < N; i++) {
    for(int j = 0; j < N; j++) {
      int cap = rng() % MAX + 1;
      mf.add_edge(i, j, cap, cap);
      mf2.add_edge(i, j, cap, cap);
    }
  }

  for(int i = 0; i < N; ++i) {
    for(int j = 0; j < N; ++j) {
      if (i != j)
        assert_equal(mf2.max_flow(i, j), mf.max_flow(i, j));
    }
  }
}

void test3() {
  int N = 20;