Searched refs:dependency_graph (Results 1 – 3 of 3) sorted by relevance
134 def __init__(self, dependency_graph: DiGraph, debug=False):137 for module_name, attrs in dependency_graph.nodes.items():154 error_context = dependency_graph.nodes[module_name].get("error_context")167 module_path = dependency_graph.first_path(module_name)178 self.dependency_graph = dependency_graph248 self.dependency_graph = DiGraph()355 self.dependency_graph.add_node(397 self.dependency_graph.add_node(409 self.dependency_graph.add_edge(module_name, dep)467 module_name in self.dependency_graph[all …]
72 const std::vector<std::vector<uint64_t>> &dependency_graph) { in FindImplicityProducers() argument85 if (i >= dependency_graph.size()) { in FindImplicityProducers()89 for (auto j : dependency_graph.at(i)) { in FindImplicityProducers()216 std::vector<std::vector<uint64_t>> dependency_graph; in ReduceWhileOperands() local217 dependency_graph.reserve(n); in ReduceWhileOperands()225 dependency_graph.push_back(neighbors); in ReduceWhileOperands()230 dependency_graph))) { in ReduceWhileOperands()
27 m for m, attr in exc.dependency_graph.nodes.items() if attr.get("error", False)30 path = exc.dependency_graph.first_path(module_name)