NUM_VERTICES      214 opal/util/bipartite_graph.c     for (i = 0; i < NUM_VERTICES(g); ++i) {
NUM_VERTICES      223 opal/util/bipartite_graph.c     for (i = 0; i < NUM_VERTICES(g); ++i) {
NUM_VERTICES      276 opal/util/bipartite_graph.c     for (i = 0; i < NUM_VERTICES(g); ++i) {
NUM_VERTICES      286 opal/util/bipartite_graph.c     for (i = 0; i < NUM_VERTICES(g); ++i) {
NUM_VERTICES      335 opal/util/bipartite_graph.c     if (from < 0 || from >= NUM_VERTICES(g)) {
NUM_VERTICES      338 opal/util/bipartite_graph.c     if (to < 0 || to >= NUM_VERTICES(g)) {
NUM_VERTICES      416 opal/util/bipartite_graph.c     return NUM_VERTICES(g);
NUM_VERTICES      506 opal/util/bipartite_graph.c     if (source < 0 || source >= NUM_VERTICES(gx)) {
NUM_VERTICES      509 opal/util/bipartite_graph.c     if (target < 0 || target >= NUM_VERTICES(gx)) {
NUM_VERTICES      527 opal/util/bipartite_graph.c     for (i = 1; i < NUM_VERTICES(gx); ++i) {
NUM_VERTICES      530 opal/util/bipartite_graph.c         dump_vec("pred", pred, NUM_VERTICES(gx));
NUM_VERTICES      531 opal/util/bipartite_graph.c         dump_vec64("dist", dist, NUM_VERTICES(gx));
NUM_VERTICES      534 opal/util/bipartite_graph.c         for (u = 0; u < NUM_VERTICES(gx); ++u) {
NUM_VERTICES      562 opal/util/bipartite_graph.c     for (u = 0; u < NUM_VERTICES(gx); ++u) {
NUM_VERTICES      584 opal/util/bipartite_graph.c     dump_vec("pred", pred, NUM_VERTICES(gx));
NUM_VERTICES      789 opal/util/bipartite_graph.c         dump_vec("pred", pred, NUM_VERTICES(gx));
NUM_VERTICES      897 opal/util/bipartite_graph.c     dump_flow(flow, NUM_VERTICES(gx));
NUM_VERTICES      101 opal/util/bipartite_graph_internal.h             (v) >= NUM_VERTICES(g)) {		\