Method
merge_edge_graph
(
self, new_edge_graph: dict[Node, dict[Node, list[Node]]]
)
Source from the content-addressed store, hash-verified
| 108 | return list(result) |
| 109 | |
| 110 | def merge_edge_graph( |
| 111 | self, new_edge_graph: dict[Node, dict[Node, list[Node]]] |
| 112 | ) -> None: |
| 113 | for x, xdict in new_edge_graph.items(): |
| 114 | if x in self.edge_graph: |
| 115 | self.edge_graph[x].update(dict(xdict)) |
| 116 | else: |
| 117 | self.edge_graph[x] = dict(xdict) |
| 118 | |
| 119 | def merge(self, nodes: list[Node], deps: list[Any]) -> None: |
| 120 | for node in nodes: |
Tested by
no test coverage detected