edge_subgraph(G, edges)
The induced subgraph contains each edge in edges
and each node incident to any of those edges.
To create a mutable subgraph with its own copies of nodes edges and attributes use :None:None:`subgraph.copy()` or :None:None:`Graph(subgraph)`
If you create a subgraph of a subgraph recursively you can end up with a chain of subgraphs that becomes very slow with about 15 nested subgraph views. Luckily the edge_subgraph filter nests nicely so you can use the original graph as G in this function to avoid chains. We do not rule out chains programmatically so that odd cases like an edge_subgraph
of a restricted_view
can be created.
A read-only edge-induced subgraph of G. Changes to G are reflected in the view.
Returns a view of 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.function.restricted_view
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