We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 592dade commit 09b338cCopy full SHA for 09b338c
pydatastructs/graphs/adjacency_list.py
@@ -38,8 +38,9 @@ def neighbors(self, node):
38
return [self.__getattribute__(name) for name in node.adjacent]
39
40
def add_vertex(self, node):
41
- self.vertices.append(node.name)
42
- self.__setattr__(node.name, node)
+ if not hasattr(self, node.name):
+ self.vertices.append(node.name)
43
+ self.__setattr__(node.name, node)
44
45
def remove_vertex(self, name):
46
delattr(self, name)
0 commit comments