remove_edge(self, u, v)
Remove the edge between nodes u and v.
If there is not an edge between u and v.
Remove the edge between u and v.
remove_edges_from
remove a collection of edges
>>> G = nx.path_graph(4) # or DiGraph, etcSee :
... G.remove_edge(0, 1)
... e = (1, 2)
... G.remove_edge(*e) # unpacks e from an edge tuple
... e = (2, 3, {"weight": 7}) # an edge with attribute data
... G.remove_edge(*e[:2]) # select first part of edge tuple
The following pages refer to to this document either explicitly or contain code examples using this.
networkx.classes.graph.Graph.remove_edge
networkx.classes.digraph.DiGraph.remove_edge
networkx.classes.graph.Graph.remove_edges_from
networkx.algorithms.flow.gomory_hu.gomory_hu_tree
networkx.algorithms.components.biconnected.biconnected_components
Hover to see nodes names; edges to Self not shown, Caped at 50 nodes.
Using a canvas is more power efficient and can get hundred of nodes ; but does not allow hyperlinks; , arrows or text (beyond on hover)
SVG is more flexible but power hungry; and does not scale well to 50 + nodes.
All aboves nodes referred to, (or are referred from) current nodes; Edges from Self to other have been omitted (or all nodes would be connected to the central node "self" which is not useful). Nodes are colored by the library they belong to, and scaled with the number of references pointing them