summaryrefslogtreecommitdiff
path: root/networkx/classes/digraph.py
diff options
context:
space:
mode:
authordschult <none@none>2009-08-13 19:09:50 +0000
committerdschult <none@none>2009-08-13 19:09:50 +0000
commit778a7ec03e56a3b8887179e4f34df249f9aac669 (patch)
treea9864c0902aef5373b7e3bf24c63d6f19e2e1412 /networkx/classes/digraph.py
parentcdb65f1d4b5f3a0583569ee278b1d0c0aea66ebf (diff)
downloadnetworkx-778a7ec03e56a3b8887179e4f34df249f9aac669.tar.gz
change delete_* to remove_* and has_neighbor to has_edge
--HG-- extra : convert_revision : svn%3A3ed01bd8-26fb-0310-9e4c-ca1a4053419f/networkx/trunk%401377
Diffstat (limited to 'networkx/classes/digraph.py')
-rw-r--r--networkx/classes/digraph.py2
1 files changed, 0 insertions, 2 deletions
diff --git a/networkx/classes/digraph.py b/networkx/classes/digraph.py
index 254f1178..6c31330f 100644
--- a/networkx/classes/digraph.py
+++ b/networkx/classes/digraph.py
@@ -943,8 +943,6 @@ class DiGraph(Graph):
Notes
-----
- Notes
- -----
If edges in both directions (u,v) and (v,u) exist in the
graph, attributes for the new undirected edge will be a combination of
the attributes of the directed edges. The edge data is updated