Kruskal's Algorithm - Modify to matrix data structure?
<p>This version of Kruskal's algorithm represents the edges with a adjacency list.
How would I modify the pseudo-code to instead use a adjacency matrix?</p>

<p><a href="https://i.stack.imgur.com/RN7h3.jpg" rel="nofollow noreferrer"><img src="https://i.stack.imgur.com/RN7h3.jpg" alt="Kruskal Pseudo-code"></a></p>

<p>I was thinking you we would need to use the weight of edges for instance (i,j), as long as its not zero. Assigning the vertices to i,j. I may be a bit confused on this pseudo-code of Kruskals.</p>