source_idx        186 opal/util/bipartite_graph.c     g->source_idx = -1;
source_idx        466 opal/util/bipartite_graph.c     FOREACH_UV_ON_PATH(pred, gx->source_idx, gx->sink_idx, u, v) {
source_idx        620 opal/util/bipartite_graph.c     err = opal_bp_graph_add_vertex(g, NULL, &g->source_idx);
source_idx        662 opal/util/bipartite_graph.c             err = opal_bp_graph_add_edge(g, g->source_idx, u,
source_idx        783 opal/util/bipartite_graph.c     while (opal_bp_graph_bellman_ford(gx, gx->source_idx, gx->sink_idx, pred)) {
source_idx        796 opal/util/bipartite_graph.c         FOREACH_UV_ON_PATH(pred, gx->source_idx, gx->sink_idx, u, v) {
source_idx         68 opal/util/bipartite_graph_internal.h     int source_idx;
source_idx         63 test/util/bipartite_graph.c         check(g->source_idx >= -1 || g->source_idx < opal_bp_graph_order(g));       \
source_idx        788 test/util/bipartite_graph.c     check_int_eq(g->source_idx, 5);
source_idx        832 test/util/bipartite_graph.c     check_int_eq(g->source_idx, 5);
source_idx        877 test/util/bipartite_graph.c     check_int_eq(g->source_idx, 5);