i_                 77 test/util/bipartite_graph.c         int i_, j_;                                \
i_                 79 test/util/bipartite_graph.c         for (i_ = 0; i_ < n; ++i_) {               \
i_                 80 test/util/bipartite_graph.c             check(pred[i_] >= -1);                 \
i_                 81 test/util/bipartite_graph.c             check(pred[i_] < n);                   \
i_                 83 test/util/bipartite_graph.c         i_ = (sink);                               \
i_                 85 test/util/bipartite_graph.c         while (i_ != -1 && j_ != -1) {             \
i_                 86 test/util/bipartite_graph.c             check_msg(i_ != j_, "CYCLE DETECTED"); \
i_                 87 test/util/bipartite_graph.c             i_ = pred[i_];                         \