Αλγόριθμος του 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...
Main Authors: | Georgiou, Dimitrios, Antoniou, Efstathios, Chatzimichailidis, Anestis, Γεωργίου, Δημήτριος, Αντωνίου, Ευστάθιος, Χατζημιχαηλίδης, Ανέστης |
---|---|
Format: | 110 |
Language: | Greek |
Published: |
2015
|
Subjects: | |
Online Access: | http://localhost:8080/jspui/handle/11419/450 |
Similar Items
-
Επίπεδοι Γράφοι με μη διασταυρούμενες ακμές
by: Georgiou, Dimitrios, et al.
Published: (2015) -
Εντοπισμός γεφυρών σε επίπεδο γράφο
by: Georgiou, Dimitrios, et al.
Published: (2015) -
Discrete Mathematical Structures in Computer Science
by: Γεωργίου, Δημήτριος, et al.
Published: (2015) -
Αλγόριθμος του Kruskal
by: Γεωργίου, Δημήτριος, et al.
Published: (2024) -
Διαδρομές Euler και Hamilton
by: Georgiou, Dimitrios, et al.
Published: (2015)