English version is in beta. All contents of the site should be already translated (mostly using machine translation), and everything should work properly. However, if you find any problems, please contact me.

Disjoint set union and the minimal spanning tree

See the corresponding lecture of Parallel A'
See the lectures "DSU" and "Spanning trees" from SIS.2008.B'

Theory on e-maxx:
- DSU
- Kruskal 's algorithm
- How to use DSU in Kruskal's algorithm
- Prim's algorithm

algoprog.ru © Petr Kalinin, GNU AGPL, github.com/petr-kalinin/algoprog | About the license for the site materials | Blog (in Russian)