Kruskal Algorithm. - Τμήμα Μηχ. Η/Υ & Πληροφορικής - Σελίδες Φοιτητών

The Kruskal Algorithm starts with a forest which consists of n trees.Each and everyone tree,consists only by one node and nothing else.In every step of the algorithm,two different trees of this forest are connected to a bigger tree.Therefore ,we keep havi

students.ceid.upatras.gr