Nvm, I was acutually thinking about Dijkstra’s Algorithm not Kruskal’s, been struggling getting to nlogn. The best achievable complexity with my given approach is 𝑂 ( ( 𝑛 + 𝑚 ) log ⁡ 𝑛 ), which is close but not strictly 𝑂 ( 𝑁 log ⁡ 𝑁 ) this is for security_routing.py