MCPcopy Create free account
hub / github.com/easy-graph/Easy-Graph / remove_node

Method remove_node

easygraph/classes/graph.py:1150–1177  ·  view source on GitHub ↗

Remove one node from your graph. Parameters ---------- node_to_remove : object The node you want to remove. See Also -------- remove_nodes Examples -------- Remove node *Jack* from *G* >>> G.remove_node('

(self, node_to_remove)

Source from the content-addressed store, hash-verified

1148 self._clear_cache()
1149
1150 def remove_node(self, node_to_remove):
1151 """Remove one node from your graph.
1152
1153 Parameters
1154 ----------
1155 node_to_remove : object
1156 The node you want to remove.
1157
1158 See Also
1159 --------
1160 remove_nodes
1161
1162 Examples
1163 --------
1164 Remove node *Jack* from *G*
1165
1166 >>> G.remove_node('Jack')
1167
1168 """
1169 try:
1170 neighbors = list(self._adj[node_to_remove])
1171 del self._node[node_to_remove]
1172 except KeyError: # Node not exists in self
1173 raise EasyGraphError("No node {} in graph.".format(node_to_remove))
1174 for neighbor in neighbors: # Remove edges with other nodes
1175 del self._adj[neighbor][node_to_remove]
1176 del self._adj[node_to_remove] # Remove this node
1177 self._clear_cache()
1178
1179 def remove_nodes(self, nodes_to_remove: list):
1180 """Remove nodes from your graph.

Callers 11

remove_nodesMethod · 0.95
test_remove_nodeMethod · 0.45
k_coreFunction · 0.45
effective_sizeFunction · 0.45
_find_separation_nodesFunction · 0.45
common_greedyFunction · 0.45
AP_GreedyFunction · 0.45
test_edgelist_graphMethod · 0.45
test_edgelist_digraphMethod · 0.45

Calls 2

_clear_cacheMethod · 0.95
EasyGraphErrorClass · 0.90

Tested by 3

test_remove_nodeMethod · 0.36
test_edgelist_graphMethod · 0.36
test_edgelist_digraphMethod · 0.36