graphit/graph.py
def remove_edge(self, nd1, nd2, directed=None):
        """
        Removing an edge from the graph
        
        Checks if the graph contains the edge, then removes it. If the graph is
        undirectional, try to remove both edges of the undirectional pair.
        Force directed removal of the edge using the 'directed' argument.
        Useful in mixed (un)-directional graphs.

        If the graph is a (sub)graph representing a `view` on the origin graph,
        the edge is removed from the view and not from the origin.
        
        :param nd1:        first node in edge node pair. Source node in
                           directed graph.
        :param nd2:        second node in edge node pair. Target node in
                           directed graph.
        :param directed:   force directed removal of the edge
        :type directed:    :py:bool

        :raises:           GraphitException, if edge not in graph
        """

        if not isinstance(directed, bool):
            directed = self.directed
        
        # Make edges, directed or undirected based on graph settings
        for edge in make_edges((nd1, nd2), directed=directed):
            if edge in self.edges:
                del self.edges[edge]
                logger.debug('Removed edge {0} from graph'.format(edge))
            else:
                raise GraphitException('Unable to remove edge {0}. No such edge ID'.format(edge))

        Removing an edge from the graph
        
        Checks if the graph contains the edge, then removes it. If the graph is
        undirectional, try to remove both edges of the undirectional pair.
        Force directed removal of the edge using the 'directed' argument.
        Useful in mixed (un)-directional graphs.

        If the graph is a (sub)graph representing a `view` on the origin graph,
        the edge is removed from the view and not from the origin.
        
        :param nd1:        first node in edge node pair. Source node in
                           directed graph.
        :param nd2:        second node in edge node pair. Target node in
                           directed graph.
        :param directed:   force directed removal of the edge
        :type directed:    :py:bool

        :raises:           GraphitException, if edge not in graph
        
Removing an edge from the graph
Checks if the graph contains the edge, then removes it. If the graph is
undirectional, try to remove both edges of the undirectional pair.
Force directed removal of the edge using the 'directed' argument.
Useful in mixed (un)-directional graphs.

If the graph is a (sub)graph representing a `view` on the origin graph,
the edge is removed from the view and not from the origin.
Removing an edge from the graph Checks if the graph contains the edge then removes it . If the graph is undirectional try to remove both edges of the undirectional pair . Force directed removal of the edge using the ' directed ' argument . Useful in mixed ( un ) - directional graphs . If the graph is a ( sub ) graph representing a ` view ` on the origin graph the edge is removed from the view and not from the origin .
def remove_edge(self, nd1, nd2, directed=None):
        if not isinstance(directed, bool):
            directed = self.directed
        for edge in make_edges((nd1, nd2), directed=directed):
            if edge in self.edges:
                del self.edges[edge]
                logger.debug('Removed edge {0} from graph'.format(edge))
            else:
                raise GraphitException('Unable to remove edge {0}. No such edge ID'.format(edge))
def remove_edge ( self , nd1 , nd2 , directed = None ) : if not isinstance ( directed , bool ) : directed = self . directed for edge in make_edges ( ( nd1 , nd2 ) , directed = directed ) : if edge in self . edges : del self . edges [ edge ] logger . debug ( 'Removed edge {0} from graph' . format ( edge ) ) else : raise GraphitException ( 'Unable to remove edge {0}. No such edge ID' . format ( edge ) )
Removing an edge from the graph
Checks if the graph contains the edge, then removes it.
Removing an edge from the graph Checks if the graph contains the edge then removes it .
"""
        Removing an edge from the graph
        
        Checks if the graph contains the edge, then removes it. If the graph is
        undirectional, try to remove both edges of the undirectional pair.
        Force directed removal of the edge using the 'directed' argument.
        Useful in mixed (un)-directional graphs.

        If the graph is a (sub)graph representing a `view` on the origin graph,
        the edge is removed from the view and not from the origin.
        
        :param nd1:        first node in edge node pair. Source node in
                           directed graph.
        :param nd2:        second node in edge node pair. Target node in
                           directed graph.
        :param directed:   force directed removal of the edge
        :type directed:    :py:bool

        :raises:           GraphitException, if edge not in graph
        """ # Make edges, directed or undirected based on graph settings
GraphitException, if edge not in graph
GraphitException if edge not in graph
self
nd1
first node in edge node pair. Source node in
directed graph.
first node in edge node pair . Source node in directed graph .
nd2
second node in edge node pair. Target node in
directed graph.
second node in edge node pair . Target node in directed graph .
directed
force directed removal of the edge
force directed removal of the edge