MAX_COST          341 opal/util/bipartite_graph.c     if (cost == MAX_COST) {
MAX_COST          521 opal/util/bipartite_graph.c         dist[i] = MAX_COST;
MAX_COST          543 opal/util/bipartite_graph.c                     dist[u] != MAX_COST) { /* avoid signed overflow for "infinity" */
MAX_COST          568 opal/util/bipartite_graph.c                 dist[u] != MAX_COST && /* avoid signed overflow */
MAX_COST          578 opal/util/bipartite_graph.c     if (dist[target] != MAX_COST) {