Αλγόριθμος του Kruskal

Kruskal's algorithm is a minimum-spanning-tree algorithm which finds a minimum spanning tree for a connected weighted graph adding increasing cost arcs at each step. This means it finds a subset of the edges that forms a tree that includes every vertex, where the total weight of all the edge...

Full description

Bibliographic Details
Main Authors: Georgiou, Dimitrios, Antoniou, Efstathios, Chatzimichailidis, Anestis, Γεωργίου, Δημήτριος, Αντωνίου, Ευστάθιος, Χατζημιχαηλίδης, Ανέστης
Format: 110
Language:Greek
Published: 2015
Subjects:
Online Access:http://localhost:8080/jspui/handle/11419/450