python/data_mining/graph.py
def pop_node(self, node):
        """Removes the node from the graph.

        Args:
            node (int): the node (index) to remove.
        """
        if node not in self._node_neighbors:
            raise ValueError('node: {} does not exist'.format(node))
        for neigh in self._node_neighbors[node]:
            self._node_neighbors[neigh].remove(node)
        del self._node_neighbors[node]
Removes the node from the graph.

        Args:
            node (int): the node (index) to remove.
        
Removes the node from the graph.
Removes the node from the graph .
def pop_node(self, node):
        if node not in self._node_neighbors:
            raise ValueError('node: {} does not exist'.format(node))
        for neigh in self._node_neighbors[node]:
            self._node_neighbors[neigh].remove(node)
        del self._node_neighbors[node]
def pop_node ( self , node ) : if node not in self . _node_neighbors : raise ValueError ( 'node: {} does not exist' . format ( node ) ) for neigh in self . _node_neighbors [ node ] : self . _node_neighbors [ neigh ] . remove ( node ) del self . _node_neighbors [ node ]
Removes the node from the graph.
Removes the node from the graph .
"""Removes the node from the graph.

        Args:
            node (int): the node (index) to remove.
        """
self
node
the node (index) to remove.
the node ( index ) to remove .