Revise "see also" references in bipartite to use short names.

Addresses #596
networkx · Jul 20, 2011 · e2d725c · e2d725c
1 parent 49a19eb
commit e2d725c
Show file tree

Hide file tree

Showing 4 changed files with 25 additions and 25 deletions.
diff --git a/networkx/algorithms/bipartite/centrality.py b/networkx/algorithms/bipartite/centrality.py
@@ -34,8 +34,8 @@ def degree_centrality(G, nodes):
     --------
     betweenness_centrality,
     closeness_centrality,
-    networkx.algorithms.bipartite.basic.sets,
-    networkx.algorithms.bipartite.basic.is_bipartite
+    sets,
+    is_bipartite
 
     Notes
     -----
@@ -131,8 +131,8 @@ def betweenness_centrality(G, nodes):
     --------
     degree_centrality,
     closeness_centrality,
-    networkx.algorithms.bipartite.basic.sets,
-    networkx.algorithms.bipartite.basic.is_bipartite
+    sets,
+    is_bipartite
 
     Notes
     -----
@@ -196,8 +196,8 @@ def closeness_centrality(G, nodes, normalized=True):
     --------
     betweenness_centrality,
     degree_centrality
-    networkx.algorithms.bipartite.basic.sets,
-    networkx.algorithms.bipartite.basic.is_bipartite
+    sets,
+    is_bipartite
 
     Notes
     -----

diff --git a/networkx/algorithms/bipartite/cluster.py b/networkx/algorithms/bipartite/cluster.py
@@ -89,7 +89,7 @@ def clustering(G, nodes=None, mode='dot'):
 
     See Also
     --------
-    networkx.algorithms.bipartite.cluster.average_clustering
+    average_clustering
     
     References
     ----------
@@ -172,7 +172,7 @@ def average_clustering(G, nodes=None, mode='dot'):
 
     See Also
     --------
-    networkx.algorithms.bipartite.cluster.clustering
+    clustering
    
     Notes    
     -----

diff --git a/networkx/algorithms/bipartite/projection.py b/networkx/algorithms/bipartite/projection.py
@@ -53,7 +53,7 @@ def projected_graph(B, nodes, multigraph=False):
     [(1, 3)]
     
     If nodes `a`, and `b` are connected through both nodes 1 and 2 then
-    building a multigraph results in two edges in the projection onto
+    building a multigraph results in two edges in the projection onto 
     [`a`,`b`]:
 
     >>> B = nx.Graph()
@@ -77,9 +77,9 @@ def projected_graph(B, nodes, multigraph=False):
 
     See Also
     --------
-    networkx.algorithms.bipartite.basic.is_bipartite, 
-    networkx.algorithms.bipartite.basic.is_bipartite_node_set, 
-    networkx.algorithms.bipartite.basic.sets, 
+    is_bipartite, 
+    is_bipartite_node_set, 
+    sets, 
     weighted_projected_graph,
     collaboration_weighted_projected_graph,
     overlap_weighted_projected_graph,
@@ -165,9 +165,9 @@ def weighted_projected_graph(B, nodes, ratio=False):
 
     See Also
     --------
-    networkx.algorithms.bipartite.basic.is_bipartite, 
-    networkx.algorithms.bipartite.basic.is_bipartite_node_set, 
-    networkx.algorithms.bipartite.basic.sets, 
+    is_bipartite, 
+    is_bipartite_node_set, 
+    sets, 
     collaboration_weighted_projected_graph,
     overlap_weighted_projected_graph,
     generic_weighted_projected_graph
@@ -260,9 +260,9 @@ def collaboration_weighted_projected_graph(B, nodes):
 
     See Also
     --------
-    networkx.algorithms.bipartite.basic.is_bipartite, 
-    networkx.algorithms.bipartite.basic.is_bipartite_node_set, 
-    networkx.algorithms.bipartite.basic.sets, 
+    is_bipartite, 
+    is_bipartite_node_set, 
+    sets, 
     weighted_projected_graph,
     overlap_weighted_projected_graph,
     generic_weighted_projected_graph,
@@ -353,9 +353,9 @@ def overlap_weighted_projected_graph(B, nodes, jaccard=True):
 
     See Also
     --------
-    networkx.algorithms.bipartite.basic.is_bipartite, 
-    networkx.algorithms.bipartite.basic.is_bipartite_node_set, 
-    networkx.algorithms.bipartite.basic.sets, 
+    is_bipartite, 
+    is_bipartite_node_set, 
+    sets, 
     weighted_projected_graph,
     collaboration_weighted_projected_graph,
     generic_weighted_projected_graph,
@@ -448,9 +448,9 @@ def generic_weighted_projected_graph(B, nodes, weight_function=None):
 
     See Also
     --------
-    networkx.algorithms.bipartite.basic.is_bipartite, 
-    networkx.algorithms.bipartite.basic.is_bipartite_node_set, 
-    networkx.algorithms.bipartite.basic.sets, 
+    is_bipartite, 
+    is_bipartite_node_set, 
+    sets, 
     weighted_projected_graph,
     collaboration_weighted_projected_graph,
     overlap_weighted_projected_graph,

diff --git a/networkx/algorithms/bipartite/spectral.py b/networkx/algorithms/bipartite/spectral.py
@@ -46,7 +46,7 @@ def spectral_bipartivity(G, nodes=None, weight='weight'):
 
     See Also
     --------
-    networkx.algorithms.bipartite.basic.color
+    color
 
     References
     ----------