✨
Yapay Zeka Hızlı Bakış & Çıkarımlar
AI Insight⚡ TL;DR(1 Cümlede Hızlı Çıkarım)
We implemented some examples of the graphs to get the results in less time and more effectively.
📌 3 Maddede Bu Makale
🎯
Amaç & Hipotez:In the life, we always aim to do anything with the less cost considering time and distance.
📊
Temel Bulgular & Veri:In graph theory, finding a minimum weight(cost or path) is a well-known problem.
💡
Sonuç & Katkı:We implemented some examples of the graphs to get the results in less time and more effectively.
🔬Tür:Araştırma Makalesi
📍Kapsam:Genişletilmiş Akademik Örneklem
⚙️Değişkenler:Alan Parametreleri
Abstract
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, weconsider a negligence algorithm to find a minimum spanning tree in another way. We report a comparison between our algorithm andKruskal's MST algorithm. We implemented some examples of the graphs to get the results in less time and more effectively.
🔖
Bu Makaleye Atıf Yap
ALKHALİSSİ, J. H., SAYLI, A. (2022). Negligence Minimum Spanning Tree Algorithm. Avrupa Bilim ve Teknoloji Dergisi, Cilt: 0 - Sayı: 14, 70–76. https://ajindex.com/articles/458315