Add a new edge to the graph. >>> graph = Graph({1, 2}, {(2, 1): 4}) >>> graph.add_edge((3, 1), 5) >>> sorted(graph.vertices) [1, 2, 3] >>> sorted([(v,k) for k,v in graph.edges.items()]) [(4, (1, 2)), (5, (1, 3))]
(self, edge: EdgeT, weight: int)
| 48 | } |
| 49 | |
| 50 | def add_edge(self, edge: EdgeT, weight: int) -> None: |
| 51 | """ |
| 52 | Add a new edge to the graph. |
| 53 | >>> graph = Graph({1, 2}, {(2, 1): 4}) |
| 54 | >>> graph.add_edge((3, 1), 5) |
| 55 | >>> sorted(graph.vertices) |
| 56 | [1, 2, 3] |
| 57 | >>> sorted([(v,k) for k,v in graph.edges.items()]) |
| 58 | [(4, (1, 2)), (5, (1, 3))] |
| 59 | """ |
| 60 | self.vertices.add(edge[0]) |
| 61 | self.vertices.add(edge[1]) |
| 62 | self.edges[(min(edge), max(edge))] = weight |
| 63 | |
| 64 | def prims_algorithm(self) -> Graph: |
| 65 | """ |