summaryrefslogtreecommitdiff
path: root/lib/git/async/graph.py
diff options
context:
space:
mode:
authorSebastian Thiel <byronimo@gmail.com>2010-06-06 21:15:13 +0200
committerSebastian Thiel <byronimo@gmail.com>2010-06-06 21:31:51 +0200
commit1b27292936c81637f6b9a7141dafaad1126f268e (patch)
treef629d098429099934a35798312e6e0660df0d677 /lib/git/async/graph.py
parentb3cde0ee162b8f0cb67da981311c8f9c16050a62 (diff)
downloadgitpython-1b27292936c81637f6b9a7141dafaad1126f268e.tar.gz
Plenty of fixes in the chunking routine, made possible by a serialized chunking test. Next up, actual async processing
Diffstat (limited to 'lib/git/async/graph.py')
-rw-r--r--lib/git/async/graph.py7
1 files changed, 6 insertions, 1 deletions
diff --git a/lib/git/async/graph.py b/lib/git/async/graph.py
index d817eeb4..6386cbaa 100644
--- a/lib/git/async/graph.py
+++ b/lib/git/async/graph.py
@@ -35,12 +35,17 @@ class Graph(object):
def del_node(self, node):
"""Delete a node from the graph
:return: self"""
+ try:
+ del(self.nodes[self.nodes.index(node)])
+ except ValueError:
+ return self
+ # END ignore if it doesn't exist
+
# clear connections
for outn in node.out_nodes:
del(outn.in_nodes[outn.in_nodes.index(node)])
for inn in node.in_nodes:
del(inn.out_nodes[inn.out_nodes.index(node)])
- del(self.nodes[self.nodes.index(node)])
return self
def add_edge(self, u, v):