edge_subgraph(self, edges)
The induced subgraph contains each edge in edges
and each node incident to any one of those edges.
The graph, edge, and node attributes in the returned subgraph view are references to the corresponding attributes in the original graph. The view is read-only.
To create a full graph version of the subgraph with its own copy of the edge or node attributes, use:
G.edge_subgraph(edges).copy()
An iterable of edges in this graph.
An edge-induced subgraph of this graph with the same edge attributes.
Returns the subgraph induced by the specified edges.
>>> G = nx.path_graph(5)
... H = G.edge_subgraph([(0, 1), (3, 4)])
... list(H.nodes) [0, 1, 3, 4]
>>> list(H.edges) [(0, 1), (3, 4)]See :
The following pages refer to to this document either explicitly or contain code examples using this.
networkx.classes.graph.Graph.edge_subgraph
networkx.classes.function.edge_subgraph
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