(self, u_of_edge, v_of_edge, edge_attr: dict = {})
| 1131 | pass |
| 1132 | |
| 1133 | def _add_one_edge(self, u_of_edge, v_of_edge, edge_attr: dict = {}): |
| 1134 | u, v = u_of_edge, v_of_edge |
| 1135 | # add nodes |
| 1136 | if u not in self._node: |
| 1137 | self._add_one_node(u) |
| 1138 | if v not in self._node: |
| 1139 | self._add_one_node(v) |
| 1140 | # add the edge |
| 1141 | datadict = self._adj[u].get(v, self.edge_attr_dict_factory()) |
| 1142 | datadict.update(edge_attr) |
| 1143 | self._adj[u][v] = datadict |
| 1144 | self._adj[v][u] = datadict |
| 1145 | if u == v: |
| 1146 | self.extra_selfloop = True |
| 1147 | self._raw_selfloop_dict[u] = datadict |
| 1148 | self._clear_cache() |
| 1149 | |
| 1150 | def remove_node(self, node_to_remove): |
| 1151 | """Remove one node from your graph. |
no test coverage detected