Lines Matching refs:graph
48 static void contract(RootOrderingGraph &graph, ArrayRef<Value> cycle, in contract() argument
57 for (auto outer = graph.begin(), e = graph.end(); outer != e; ++outer) { in contract()
87 graph.erase(outer); in contract()
117 graph[rep] = std::move(repEntries); in contract()
120 OptimalBranching::OptimalBranching(RootOrderingGraph graph, Value root) in OptimalBranching() argument
121 : graph(std::move(graph)), root(root) {} in OptimalBranching()
132 parentDepths.reserve(graph.size()); in solve()
137 for (const auto &outer : graph) { in solve()
147 auto it = graph.find(node); in solve()
148 assert(it != graph.end() && "the graph is not strongly connected"); in solve()
177 contract(graph, cycle, parentDepths, actualSource, actualTarget); in solve()