|
1 | 1 | # Kruskal's Algorithm Minimum Spanning Tree (Graph MST) |
2 | 2 |
|
3 | 3 | Java Implementation of Kruskal's Algorithm using **disjoing sets** |
4 | | -**Kruskal's algorithm:** Start with T = ∅. Consider edges in ascending order of weight. Insert edge e into T unless doing so would create a cycle |
| 4 | +**Kruskal's algorithm:** Start with **T** = ∅. Consider edges in ascending order of weight. Insert edge `e` into **T** unless doing so would create a cycle. |
5 | 5 | - Works on **UN-directed** graphs |
6 | 6 | - **Algorithm still works on edges with identical weight** |
7 | 7 | Edges are sorted by weight first. Depending on the order they are entered into the **edge list** in the **constructor**, you may get different Minimum Spanning Trees (but all still optimal solutions) |
|
0 commit comments