fixed comment for deletion of edges in undirected graphs

MaineKuehn · Jul 26, 2018 · d339d46 · d339d46
1 parent d3aef46
commit d339d46
Showing 1 changed file with 1 addition and 1 deletion.
diff --git a/graphi/types/adjacency_graph.py b/graphi/types/adjacency_graph.py
@@ -114,7 +114,7 @@ def __setitem__(self, item, value):
                     # if we know node already, clean up first
                     if item in self._adjacency:
                         for node_to in self._adjacency[item]:
-                            del self._adjacency[node_to][item]  # safe unless graph not undirected
+                            del self._adjacency[node_to][item]  # safe if graph undirected
                     for node_to in value:
                         self._adjacency[node_to][item] = value[node_to]
                 self._adjacency[item] = dict(value)