Hey there! I'm currently looking into graphs and stumbled upon Kruskal's Algorithm. I have a question regarding the implementation on https://www.programiz.com/dsa/kruskal-algorithm.
In the example, I get the first image which is the weighted graph. Afterwards one of the graphs with the least weight is chosen. Fine by me. Then we chose the next edge with the least weight. We iterate like this over the connections to the respective edge. However, prior to the last image we have two choices to draw the edge with the weight 4. The authors have made a decision and the question I have is if it matters or not (in theory it shouldn't) which one I take.