def del_node(self, node):
for each in list(self.neighbors(node)):<EOL><INDENT>if (each != node):<EOL><INDENT>self.del_edge((each, node))<EOL><DEDENT><DEDENT>del(self.node_neighbors[node])<EOL>del(self.node_attr[node])<EOL>
Remove a node from the graph.

@type  node: node
@param node: Node identifier.