Lines Matching defs:NodeIdx

319     // A pair (NodeIdx, EdgeIdx) at the top of the Stack denotes that
320     //  - we are currently visiting Nodes[NodeIdx] and
321     //  - the next edge to scan is Edges[NodeIdx][EdgeIdx]
342       auto NodeIdx = Stack.top().first;
345       // If we haven't scanned all edges out of NodeIdx, continue scanning
346       if (EdgeIdx < Edges[NodeIdx].size()) {
347         auto &Edge = Edges[NodeIdx][EdgeIdx];
358             // Else, if Edge.Dst already have a path to Target, so that NodeIdx
359             Nodes[NodeIdx].Taken = true;
363         // If we are done scanning all edge out of NodeIdx
365         // If we haven't found a path from NodeIdx to Target, forget about it
366         if (!Nodes[NodeIdx].Taken) {
367           Nodes[NodeIdx].Discovery = 0;
369           // If we have found a path from NodeIdx to Target, then finish NodeIdx
371           Nodes[NodeIdx].Finish = ++Time;
372           // NodeIdx == Source if and only if the stack is empty
373           if (NodeIdx != Source) {
377           AugmentingOrder.push_back(NodeIdx);