#NEWLINE# def remove_edge( self , u , v ) : #NEWLINE# #INDENT# "Remove the edge between u and v.\n\n        Parameters\n        ----------\n        u,v: nodes\n            Remove the edge between nodes u and v.\n\n        Raises\n        ------\n        NetworkXError\n            If there is not an edge between u and v.\n\n        See Also\n        --------\n        remove_edges_from : remove a collection of edges\n\n        Examples\n        --------\n        >>> G = nx.Graph()   # or DiGraph, etc\n        >>> G.add_path([0,1,2,3])\n        >>> G.remove_edge(0,1)\n        >>> e = (1,2)\n        >>> G.remove_edge(*e) # unpacks e from an edge tuple\n        >>> e = (2,3,{'weight':7}) # an edge with attribute data\n        >>> G.remove_edge(*e[:2]) # select first part of edge tuple\n        " #NEWLINE# try : #NEWLINE# #INDENT# del self . adj [ v ] [ v ] #NEWLINE# if ( u != v ) : #NEWLINE# #INDENT# del self . adj [ v ] [ u ] #NEWLINE# #UNINDENT# #UNINDENT# except KeyError : #NEWLINE# #INDENT# raise NetworkXError ( ( 'The edge %s-%s is not in the graph' % ( u , v ) ) )