Connects all of node1's edges to node2 and unlinks node1.
(graph, node1, node2)
| 1055 | pass |
| 1056 | |
| 1057 | def redirect(graph, node1, node2): |
| 1058 | """ Connects all of node1's edges to node2 and unlinks node1. |
| 1059 | """ |
| 1060 | if not isinstance(node1, Node): |
| 1061 | node1 = graph[node1] |
| 1062 | if not isinstance(node2, Node): |
| 1063 | node2 = graph[node2] |
| 1064 | for e in graph.edges: |
| 1065 | if node1 in (e.node1, e.node2): |
| 1066 | if e.node1 == node1 and e.node2 != node2: |
| 1067 | graph._add_edge_copy(e, node1=node2, node2=e.node2) |
| 1068 | if e.node2 == node1 and e.node1 != node2: |
| 1069 | graph._add_edge_copy(e, node1=e.node1, node2=node2) |
| 1070 | unlink(graph, node1) |
| 1071 | |
| 1072 | def cut(graph, node): |
| 1073 | """ Unlinks the given node, but keeps edges intact by connecting the surrounding nodes. |
nothing calls this directly
no test coverage detected
searching dependent graphs…