##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
(n² edges to consider)
A complete graph is a graph where every pair of nodes has an edge. With nodes, you have edges. For this problem, generating all edges upfront takes time and space. That is acceptable for small (up to ).
Kruskal still works, but you will spend time sorting edges. Prim might be faster here because it does not require generating all edges upfront. Think about the tradeoff.
