gx                253 opal/util/bipartite_graph.c     opal_bp_graph_t *gx;
gx                268 opal/util/bipartite_graph.c     gx = NULL;
gx                269 opal/util/bipartite_graph.c     err = opal_bp_graph_create(NULL, NULL, &gx);
gx                273 opal/util/bipartite_graph.c     assert(NULL != gx);
gx                277 opal/util/bipartite_graph.c         err = opal_bp_graph_add_vertex(gx, NULL, &index);
gx                289 opal/util/bipartite_graph.c             err = opal_bp_graph_add_edge(gx, e->source, e->target,
gx                297 opal/util/bipartite_graph.c     *g_clone_out = gx;
gx                303 opal/util/bipartite_graph.c     opal_bp_graph_free(gx);
gx                458 opal/util/bipartite_graph.c 		opal_bp_graph_t *gx,
gx                466 opal/util/bipartite_graph.c     FOREACH_UV_ON_PATH(pred, gx->source_idx, gx->sink_idx, u, v) {
gx                467 opal/util/bipartite_graph.c         int cap_f_uv = get_capacity(gx, u, v);
gx                487 opal/util/bipartite_graph.c bool opal_bp_graph_bellman_ford(opal_bp_graph_t *gx,
gx                498 opal/util/bipartite_graph.c     if (NULL == gx) {
gx                506 opal/util/bipartite_graph.c     if (source < 0 || source >= NUM_VERTICES(gx)) {
gx                509 opal/util/bipartite_graph.c     if (target < 0 || target >= NUM_VERTICES(gx)) {
gx                514 opal/util/bipartite_graph.c     n = opal_bp_graph_order(gx);
gx                527 opal/util/bipartite_graph.c     for (i = 1; i < NUM_VERTICES(gx); ++i) {
gx                530 opal/util/bipartite_graph.c         dump_vec("pred", pred, NUM_VERTICES(gx));
gx                531 opal/util/bipartite_graph.c         dump_vec64("dist", dist, NUM_VERTICES(gx));
gx                534 opal/util/bipartite_graph.c         for (u = 0; u < NUM_VERTICES(gx); ++u) {
gx                537 opal/util/bipartite_graph.c             FOREACH_OUT_EDGE(gx, u, e_ptr) {
gx                562 opal/util/bipartite_graph.c     for (u = 0; u < NUM_VERTICES(gx); ++u) {
gx                565 opal/util/bipartite_graph.c         FOREACH_OUT_EDGE(gx, u, e_ptr) {
gx                584 opal/util/bipartite_graph.c     dump_vec("pred", pred, NUM_VERTICES(gx));
gx                748 opal/util/bipartite_graph.c static int min_cost_flow_ssp(opal_bp_graph_t *gx,
gx                765 opal/util/bipartite_graph.c     n = opal_bp_graph_order(gx);
gx                783 opal/util/bipartite_graph.c     while (opal_bp_graph_bellman_ford(gx, gx->source_idx, gx->sink_idx, pred)) {
gx                789 opal/util/bipartite_graph.c         dump_vec("pred", pred, NUM_VERTICES(gx));
gx                793 opal/util/bipartite_graph.c         cap_f_path = bottleneck_path(gx, n, pred);
gx                796 opal/util/bipartite_graph.c         FOREACH_UV_ON_PATH(pred, gx->source_idx, gx->sink_idx, u, v) {
gx                806 opal/util/bipartite_graph.c             c = get_capacity(gx, u, v) - cap_f_path;
gx                808 opal/util/bipartite_graph.c             err = set_capacity(gx, u, v, c);
gx                815 opal/util/bipartite_graph.c             c = get_capacity(gx, v, u) + cap_f_path;
gx                817 opal/util/bipartite_graph.c             err = set_capacity(gx, v, u, c);
gx                846 opal/util/bipartite_graph.c     opal_bp_graph_t *gx = NULL;
gx                855 opal/util/bipartite_graph.c     err = opal_bp_graph_clone(g, false, &gx);
gx                873 opal/util/bipartite_graph.c     err = opal_bp_graph_bipartite_to_flow(gx);
gx                886 opal/util/bipartite_graph.c     err = min_cost_flow_ssp(gx, &flow);
gx                897 opal/util/bipartite_graph.c     dump_flow(flow, NUM_VERTICES(gx));
gx                899 opal/util/bipartite_graph.c     shrink_flow_matrix(flow, opal_bp_graph_order(gx), n);
gx                938 opal/util/bipartite_graph.c     opal_bp_graph_free(gx);
gx                133 opal/util/bipartite_graph_internal.h bool opal_bp_graph_bellman_ford(opal_bp_graph_t *gx,
gx                212 test/util/bipartite_graph.c     opal_bp_graph_t *g, *gx;
gx                246 test/util/bipartite_graph.c     gx = NULL;
gx                247 test/util/bipartite_graph.c     err = opal_bp_graph_clone(g, /*copy_user_data=*/false, &gx);
gx                249 test/util/bipartite_graph.c     check(gx != NULL);
gx                252 test/util/bipartite_graph.c     err = opal_bp_graph_free(gx);