Kruskal’s algorithm relies on a union-find algorithm for checking cycles.
A B |
![]() |
H I |
![]() |
A C |
|
D G |
![]() |
E F |
|
E H |
|
D A |
|
C A |
|