5
0
mirror of https://github.com/cwinfo/yggdrasil-map synced 2024-09-16 18:49:34 +00:00

Simplify logic in get_edges_for_peers.

This commit is contained in:
Valentin Lorentz 2016-08-21 11:21:27 +02:00
parent 3c90628f74
commit 7ec28c3a0a

View File

@ -215,12 +215,8 @@ def get_edges_for_peers(edges, peers, node_ip):
for peer_key in peers:
peer_ip = key_utils.to_ipv6(peer_key)
if node_ip > peer_ip:
A = node_ip
B = peer_ip
else:
A = peer_ip
B = node_ip
A = max(node_ip, peer_ip)
B = min(node_ip, peer_ip)
edge = { 'a': A,
'b': B }
@ -228,8 +224,8 @@ def get_edges_for_peers(edges, peers, node_ip):
if A not in edges:
edges[A] = []
if not([True for edge in edges[A] if edge['b'] == B]):
edges[A] += [edge]
if not any(edge['b'] == B for edge in edges[A]):
edges[A].append(edge)
def send_graph(nodes, edges):