summaryrefslogtreecommitdiff
path: root/networkx/classes/function.py
diff options
context:
space:
mode:
authorAnton Lodder <antonlodder@gmail.com>2019-10-08 13:05:11 -0400
committerDan Schult <dschult@colgate.edu>2019-10-08 13:05:11 -0400
commite89dc91f5b1ef35dbbdf63f3fe0345055bc581d3 (patch)
tree7223b4b1b5c82f358a3616920805e7cec0f491d5 /networkx/classes/function.py
parent5469ddab8befddee024bb4bb149c1adb57dca5eb (diff)
downloadnetworkx-e89dc91f5b1ef35dbbdf63f3fe0345055bc581d3.tar.gz
Document subgraph_view (#3627)
Fixes #3625
Diffstat (limited to 'networkx/classes/function.py')
-rw-r--r--networkx/classes/function.py18
1 files changed, 6 insertions, 12 deletions
diff --git a/networkx/classes/function.py b/networkx/classes/function.py
index 08060dca..9764db5d 100644
--- a/networkx/classes/function.py
+++ b/networkx/classes/function.py
@@ -21,11 +21,14 @@ except ImportError:
import networkx as nx
from networkx.utils import pairwise, not_implemented_for
+from networkx.classes.graphviews import subgraph_view, reverse_view
+
__all__ = ['nodes', 'edges', 'degree', 'degree_histogram', 'neighbors',
'number_of_nodes', 'number_of_edges', 'density',
- 'is_directed', 'info', 'freeze', 'is_frozen', 'subgraph',
- 'induced_subgraph', 'edge_subgraph', 'restricted_view',
- 'reverse_view', 'to_directed', 'to_undirected',
+ 'is_directed', 'info', 'freeze', 'is_frozen',
+ 'subgraph', 'subgraph_view', 'induced_subgraph', 'reverse_view',
+ 'edge_subgraph', 'restricted_view',
+ 'to_directed', 'to_undirected',
'add_star', 'add_path', 'add_cycle',
'create_empty_copy', 'set_node_attributes',
'get_node_attributes', 'set_edge_attributes',
@@ -492,15 +495,6 @@ def restricted_view(G, nodes, edges):
return nx.graphviews.subgraph_view(G, hide_nodes, hide_edges)
-@not_implemented_for('undirected')
-def reverse_view(digraph):
- """Provide a reverse view of the digraph with edges reversed.
-
- Identical to digraph.reverse(copy=False)
- """
- return nx.graphviews.reverse_view(digraph)
-
-
def to_directed(graph):
"""Returns a directed view of the graph `graph`.