summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authoraric <none@none>2007-02-14 03:46:54 +0000
committeraric <none@none>2007-02-14 03:46:54 +0000
commit3469148ee2323e6d465256221ebde871205d4a0e (patch)
tree9afb0aa615782223ac9176edd2e7b80ea9956dd5
parent5d34eb59a4029884d87b2a76d0d1d35c28c06f01 (diff)
downloadnetworkx-3469148ee2323e6d465256221ebde871205d4a0e.tar.gz
Allow edge tuple to be passed to get_edge().
Fixes #90. --HG-- extra : convert_revision : svn%3A3ed01bd8-26fb-0310-9e4c-ca1a4053419f/networkx/trunk%40521
-rw-r--r--networkx/graph.py9
1 files changed, 6 insertions, 3 deletions
diff --git a/networkx/graph.py b/networkx/graph.py
index d62c8863..c6a77301 100644
--- a/networkx/graph.py
+++ b/networkx/graph.py
@@ -418,16 +418,19 @@ class Graph(object):
return self.adj.has_key(u) and self.adj[u].has_key(v)
- def get_edge(self, n1, n2):
+ def get_edge(self, u, v):
"""Return 1 if graph contains the edge u-v.
Raise an exception otherwise.
"""
# useful for helping build adjacency matrix representation
- if self.has_edge(n1,n2):
+ if v is None:
+ (u,v)=u
+
+ if self.has_edge(u,v):
return 1
else:
- raise NetworkXError, "no edge (%s,%s) in graph"%(n1,n2)
+ raise NetworkXError, "no edge (%s,%s) in graph"%(u,v)
def neighbors_iter(self,n):