sink_idx          187 opal/util/bipartite_graph.c     g->sink_idx = -1;
sink_idx          466 opal/util/bipartite_graph.c     FOREACH_UV_ON_PATH(pred, gx->source_idx, gx->sink_idx, u, v) {
sink_idx          624 opal/util/bipartite_graph.c     err = opal_bp_graph_add_vertex(g, NULL, &g->sink_idx);
sink_idx          650 opal/util/bipartite_graph.c             err = opal_bp_graph_add_edge(g, u, g->sink_idx,
sink_idx          783 opal/util/bipartite_graph.c     while (opal_bp_graph_bellman_ford(gx, gx->source_idx, gx->sink_idx, pred)) {
sink_idx          796 opal/util/bipartite_graph.c         FOREACH_UV_ON_PATH(pred, gx->source_idx, gx->sink_idx, u, v) {
sink_idx           71 opal/util/bipartite_graph_internal.h     int sink_idx;
sink_idx           64 test/util/bipartite_graph.c         check(g->sink_idx >= -1 || g->sink_idx < opal_bp_graph_order(g));           \
sink_idx          789 test/util/bipartite_graph.c     check_int_eq(g->sink_idx, 6);
sink_idx          833 test/util/bipartite_graph.c     check_int_eq(g->sink_idx, 6);
sink_idx          878 test/util/bipartite_graph.c     check_int_eq(g->sink_idx, 6);