Searched refs:NodeInfoMap (Results 1 – 1 of 1) sorted by relevance
277 NodeInfo *G1 = find(&NodeInfoMap[Edge->Source]); in unionGroups()278 NodeInfo *G2 = find(&NodeInfoMap[Edge->Target]); in unionGroups()296 std::unordered_map<NodeType *, NodeInfo> NodeInfoMap; variable314 NodeInfoMap.clear(); in scc_member_iterator()319 (void)NodeInfoMap[Node].Group; in scc_member_iterator()332 if (NodeInfoMap.count(Edge.Target)) in scc_member_iterator()352 NodeInfoMap[Edge->Target].IncomingMSTEdges.insert(Edge); in scc_member_iterator()357 if (!NodeInfoMap[Edge->Source].Visited && in scc_member_iterator()358 NodeInfoMap[Edge->Source].IncomingMSTEdges.empty()) { in scc_member_iterator()360 NodeInfoMap[Edge->Source].Visited = true; in scc_member_iterator()[all …]