(root: object)
| 74 | |
| 75 | |
| 76 | def get_reachable_graph(root: object) -> tuple[dict[int, object], dict[int, tuple[int, object]]]: |
| 77 | parents = {} |
| 78 | seen = {id(root): root} |
| 79 | worklist = [root] |
| 80 | while worklist: |
| 81 | o = worklist.pop() |
| 82 | for s, e in get_edges(o): |
| 83 | if id(e) in seen: |
| 84 | continue |
| 85 | parents[id(e)] = (id(o), s) |
| 86 | seen[id(e)] = e |
| 87 | worklist.append(e) |
| 88 | |
| 89 | return seen, parents |
| 90 | |
| 91 | |
| 92 | def get_path( |
no test coverage detected
searching dependent graphs…