Lines Matching defs:Edges
96 Edges = std::vector<std::vector<Edge>>(NodeCount, std::vector<Edge>());
114 for (auto &Edge : Edges[Src]) {
142 SrcEdge.RevEdgeIndex = Edges[Dst].size();
149 DstEdge.RevEdgeIndex = Edges[Src].size();
151 Edges[Src].push_back(SrcEdge);
152 Edges[Dst].push_back(DstEdge);
164 for (const auto &Edge : Edges[Src]) {
174 for (const auto &Edge : Edges[Src]) {
221 auto &Edge = Edges[Pred][Nodes[Now].ParentEdgeIndex];
270 for (uint64_t EdgeIdx = 0; EdgeIdx < Edges[Src].size(); EdgeIdx++) {
271 auto &Edge = Edges[Src][EdgeIdx];
299 auto &Edge = Edges[Pred][Nodes[Now].ParentEdgeIndex];
300 auto &RevEdge = Edges[Now][Edge.RevEdgeIndex];
313 /// runs in O(MaxDfsCalls * |Edges| + |Nodes|) time.
321 // - the next edge to scan is Edges[NodeIdx][EdgeIdx]
346 if (EdgeIdx < Edges[NodeIdx].size()) {
347 auto &Edge = Edges[NodeIdx][EdgeIdx];
387 for (auto &Edge : Edges[Src]) {
484 auto &RevEdge = Edges[Edge->Dst][Edge->RevEdgeIndex];
511 for (auto &Edge : Edges[Src]) {
573 std::vector<std::vector<Edge>> Edges;
1083 // Edges from S and to T