Μελέτη αλγορίθμων εύρεσης ελαχίστων ζευγνυόντων δέντρων
Master Thesis
Date
2011-09-29View/
Abstract
The problem of finding minimum spanning trees is one of the most fundamental scientific problems. It has important applications in networks to design and optimizes them. This problem has been the subject of investigation and study of many scientists leading to the development of many efficient polynomial time algorithms. The goal of this thesis is to present the most important of these algorithms. This will be achieved through graphic examples of the algorithms in order to explain them. Simultaneously it will be given the pseudocode needed to execute each one of them. Furthermore in this thesis the algorithms Kruskal, Dijkstra and Prim are presented by using both C and Pascal programming languages. Finally, it will be presented the algorithms that were developed for handling graphs in C language for graphs with 4, 5 and 6 nodes.
Language
GreekCollections
Except where otherwise noted, this item's license is described as
Αναφορά Δημιουργού-Μη Εμπορική Χρήση-Όχι Παράγωγα Έργα 4.0 Διεθνές
Αναφορά Δημιουργού-Μη Εμπορική Χρήση-Όχι Παράγωγα Έργα 4.0 Διεθνές