hasslesstech/dpks-lab3
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

yet another performance improvement

Browse Source
This commit is contained in:
hasslesstech
2026-10-25 21:05:38 +02:00
parent 8af4bb0b99
commit 3077e14c07
1 changed files with 8 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files
main.py
+8 -1
View File
@@ -131,10 +131,17 @@ def build_network(n):
#if lvl(i) == lvl(i - l_lvl) and l_lvl: #if lvl(i) == lvl(i - l_lvl) and l_lvl:
join_nodes(g, nn(i, 'lu'), nn(neigh(i, -l_lvl * 2), 'ld')) join_nodes(g, nn(i, 'lu'), nn(neigh(i, -l_lvl * 2), 'ld'))
join_nodes(g, nn(i, 'rs'), nn(neigh(i, +l_lvl * 3), 'ls'))
join_nodes(g, nn(i, 'ls'), nn(neigh(i, -l_lvl * 5), 'rs'))
# irregular: inline ring # irregular: inline ring
join_nodes(g, nn(i, 'rs'), nn(neigh(i, +1), 'ls'), 5) join_nodes(g, nn(i, 'rs'), nn(neigh(i, +1), 'ls'), 5)
join_nodes(g, nn(i, 'ls'), nn(neigh(i, -1), 'rs'), 5) join_nodes(g, nn(i, 'ls'), nn(neigh(i, -1), 'rs'), 5)
#if l_lvl >= 4:
#join_nodes(g, nn(i, 'rs'), nn(neigh(i, +12), 'ls'), 6)
#join_nodes(g, nn(i, 'ls'), nn(neigh(i, -12), 'rs'), 6)
return g return g
def analyze(G: nx.Graph) -> dict: def analyze(G: nx.Graph) -> dict:
@@ -269,7 +276,7 @@ def test2():
print(set([v for i, v in g.degree()])) print(set([v for i, v in g.degree()]))
def test3(): def test3():
g = build_network(7) g = build_network(3)
visualize(g) visualize(g)
if __name__=="__main__": if __name__=="__main__":