remove_edges_from(self, ebunch)

Notes

Will fail silently if an edge in ebunch is not in the graph.

Parameters

ebunch: list or container of edge tuples :

Each edge given in the list or container will be removed from the graph. The edges can be:

• 2-tuples (u, v) edge between u and v.

• 3-tuples (u, v, k) where k is ignored.

Remove all edges specified in ebunch.

See Also

remove_edge

remove a single edge

Examples

>>> G = nx.path_graph(4)  # or DiGraph, MultiGraph, MultiDiGraph, etc
... ebunch = [(1, 2), (2, 3)]
... G.remove_edges_from(ebunch)

See :

Back References

The following pages refer to to this document either explicitly or contain code examples using this.

networkx.generators.degree_seq.directed_configuration_model networkx.classes.digraph.DiGraph.remove_edge networkx.algorithms.cycles.simple_cycles

Local connectivity graph

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

---

GitHub : /networkx/classes/digraph.py#744
type: <class 'function'>
Commit: