restricted_view(G, nodes, edges)¶
Returns a view of
Gwith hidden nodes and edges.
G (NetworkX Graph)
nodes (iterable) – An iterable of nodes. Nodes not present in
edges (iterable) – An iterable of edges. Edges not present in
subgraph – A read-only restricted view of
Gfiltering out nodes and edges. Changes to
Gare reflected in the view.
- Return type
To create a mutable subgraph with its own copies of nodes edges and attributes use
If you create a subgraph of a subgraph recursively you may end up with a chain of subgraph views. Such chains can get quite slow for lengths near 15. To avoid long chains, try to make your subgraph based on the original graph. We do not rule out chains programmatically so that odd cases like an
restricted_viewcan be created.
>>> import networkx as nx >>> G = nx.path_graph(5) >>> H = nx.restricted_view(G, , [(1, 2), (3, 4)]) >>> list(H.nodes) [1, 2, 3, 4] >>> list(H.edges) [(2, 3)]