Searched refs:AllEdges (Results 1 – 2 of 2) sorted by relevance
44 std::vector<std::unique_ptr<Edge>> AllEdges; variable220 llvm::stable_sort(AllEdges, [](const std::unique_ptr<Edge> &Edge1, in sortEdgesByWeight()232 for (auto &Ei : AllEdges) { in computeMinimumSpanningTree()243 for (auto &Ei : AllEdges) { in computeMinimumSpanningTree()267 OS << " Number of Edges: " << AllEdges.size() in dumpEdges()270 for (auto &EI : AllEdges) in dumpEdges()290 AllEdges.emplace_back(new Edge(Src, Dest, W)); in addEdge()291 return *AllEdges.back(); in addEdge()301 if (AllEdges.size() > 1 && InstrumentFuncEntry) in F()302 std::iter_swap(std::move(AllEdges.begin()), in F()[all …]
670 AllEdges.reserve(AllJumps.size()); in initialize()683 AllEdges.emplace_back(Jump); in initialize()684 PredNode.CurChain->addEdge(SuccNode->CurChain, &AllEdges.back()); in initialize()685 SuccNode->CurChain->addEdge(PredNode.CurChain, &AllEdges.back()); in initialize()1029 std::vector<ChainEdge> AllEdges; member in __anon0ffa47bc0111::ExtTSPImpl1109 AllEdges.reserve(AllJumps.size()); in initialize()1121 AllEdges.emplace_back(Jump); in initialize()1122 PredNode.CurChain->addEdge(SuccNode->CurChain, &AllEdges.back()); in initialize()1123 SuccNode->CurChain->addEdge(PredNode.CurChain, &AllEdges.back()); in initialize()1399 std::vector<ChainEdge> AllEdges; member in __anon0ffa47bc0111::CDSortImpl