680             long int actnode = (long int) igraph_dqueue_pop(&Q);  in igraph_maxflow()  local
681             for (i = FIRST(actnode), j = LAST(actnode); i < j; i++) {  in igraph_maxflow()
751             long int actnode = (long int) igraph_dqueue_pop(&Q);  in igraph_maxflow()  local
753             DIST(actnode) = actdist;  in igraph_maxflow()
755             for (i = FIRST(actnode), j = LAST(actnode); i < j; i++) {  in igraph_maxflow()
910                     long int actnode = igraph_vector_long_tail(&stack);  in igraph_maxflow()  local
911                     long int edge = FIRST(actnode) + (long int) CURRENT(actnode);  in igraph_maxflow()
913                     while (edge < LAST(actnode) && MYCAP(edge) == 0.0) {  in igraph_maxflow()
916                     nei = edge < LAST(actnode) ? HEAD(edge) : -1;  in igraph_maxflow()
918                     if (edge < LAST(actnode) && !VECTOR(added)[nei]) {  in igraph_maxflow()
924                         CURRENT(actnode) += 1;  in igraph_maxflow()
925                     } else if (edge < LAST(actnode) && VECTOR(added)[nei] == 1) {  in igraph_maxflow()
948                         CURRENT(actnode) += 1;  in igraph_maxflow()
949                     } else if (edge < LAST(actnode)) { /* && VECTOR(added)[nei]==2 */  in igraph_maxflow()
952                         CURRENT(actnode) += 1;  in igraph_maxflow()
957                         VECTOR(added)[actnode] = 2;  in igraph_maxflow()