(graph: adjacency)
| 7 | |
| 8 | |
| 9 | def _collect_nodes_and_edges(graph: adjacency) -> tuple[list[Node], list[edge]]: |
| 10 | nodes = set() |
| 11 | edges: list[edge] = [] |
| 12 | for u, neighbors in graph.items(): |
| 13 | nodes.add(u) |
| 14 | for v, w in neighbors: |
| 15 | nodes.add(v) |
| 16 | edges.append((u, v, w)) |
| 17 | return list(nodes), edges |
| 18 | |
| 19 | |
| 20 | def _bellman_ford(nodes: list[Node], edges: list[edge]) -> dict[Node, float]: |