Function test

code/graph/hopcroft_karp.test.cpp:36–41

}

void test() {
  int TESTS = 1000, MAX_N = 400, MAX_M = 300;
  for(int i = 0; i < TESTS; ++i) {
    test_rand(rng() % MAX_N, rng() % MAX_M, rng() % 100 + 1);
  }
}

// void test_rand(int N, int M, int sparse) {
//     bipartite_graph g(N, M);