We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 4b9a062 commit 41f4f39Copy full SHA for 41f4f39
graphs/graph.py
@@ -140,10 +140,7 @@ def get_edge_weights(self):
140
unique_list = {}
141
for u in self.nodes():
142
for v in self.neighbors(u):
143
- if not unique_list.get(v) or u not in unique_list.get(v):
+ if u not in unique_list.get(v, []):
144
edge_list.append((self.node_neighbors[u][v], (u, v)))
145
- if u not in unique_list:
146
- unique_list[u] = [v]
147
- else:
148
- unique_list[u].append(v)
+ unique_list.setdefault(u, [v]).append(v)
149
return edge_list
0 commit comments