Negligence Minimum Spanning Tree Algorithm
| Autor: | Jumana H.S. Alkhalissi, Ayla Sayli |
|---|---|
| Rok vydání: | 2018 |
| Předmět: | |
| Zdroj: | Issue: 14 70-76 Avrupa Bilim ve Teknoloji Dergisi |
| ISSN: | 2148-2683 |
| Popis: | In the life, we always aim to do anything withthe less cost considering time and distance. In graph theory, finding a minimumweight (cost or path) is a well-known problem. A minimum spanning tree is oneof the methods brought for this purpose. In this work, we consider a negligence algorithm to find a minimumspanning tree in another way. We report a comparison between our algorithm andKruskal's MST algorithm. We implemented some examples of the graphs to get theresults in less time and more effectively. In the life, we always aim to do anything with the less cost considering time and distance. In graph theory, finding a minimum weight (cost or path) is a well-known problem. A minimum spanning tree is one of the methods brought for this purpose. In this work, we consider a negligence algorithm to find a minimum spanning tree in another way that we called “A Negligence Minimum Spanning Tree Algorithm”. We consider a comparison between our algorithm and the classical type of the Minimum Spanning Tree Algorithm which is known as Kruskal’s algorithm because of the principle of similarity. We implemented some examples of the graphs to get the results in less time and more effectively. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|