ELEKTR TARMOQLARINI ULASHDA KRUSKAL ALGORITMINING AHAMIYATI
Keywords:
Kruskal algoritmi, minimal bog‘lovchi daraxt, elektr tarmoqlari, graf nazariyasi, samaradorlikni oshirish va algoritm cheklovlari., Kruskal's algorithm, minimum spanning tree, electrical networks, graph theory, improving efficiency and algorithm limitations., Алгоритм Крускала, минимальное остовное дерево, теория графов электрические сети, повышение эффективности и ограничения алгоритма.Abstract
Maqolada Kruskal algoritmining minimal bog‘lovchi daraxtni qurishdagi samaradorligi va elektr tarmoqlarini ulashdagi amaliy qo‘llanilishi va cheklovlari tahlil qilinadi. Graf nazariyasi asosida algoritmning nazariy va dasturiy asoslari qisqacha ko‘rib chiqiladi.
The article analyzes the efficiency of Kruskal's algorithm in constructing a minimum spanning tree and its practical application in connecting electrical networks, along with its limitations. The theoretical and programming foundations of the algorithm are briefly discussed based on graph theory.
В статье анализируется эффективность алгоритма Крускала при построении минимального остовного дерева и его практическое применение для подключения электрических сетей, а также его ограничения. Кратко рассматриваются теоретические и программные основы алгоритма на основе теории графов.
References
FOYDALANILGAN ADABIYOTLAR RO’YHATI
1. Cormen, T. H., Leiserson, C. E., Rivest, R. L., & Stein, C. (2009). Introduction to Algorithms (3rd ed.). The MIT Press.
2. Li, H., Xia, Q., & Wang, Y. (2017). Research and improvement of kruskal algorithm. Journal of Computer and Communications, 5(12), 63.
3. Guttoski, P. B., Sunye, M. S., & Silva, F. (2007, September). Kruskal's algorithm for query tree optimization. In 11th international database engineering and applications symposium (IDEAS 2007) (pp. 296-302). IEEE..
4. Melnikov, B. F., & Terentyeva, Y. Y. (2021, February). Building communication networks: on the application of the Kruskal’s algorithm in the problems of large dimensions. In IOP Conference Series: Materials Science and Engineering (Vol. 1047, No. 1, p. 012089). IOP Publishing..
5. Broutin, N., Devroye, L., & McLeish, E. (2010). Note on the Structure of Kruskal’s Algorithm. Algorithmica, 56, 141-159.
6. Raxmonjonovich, F. S., & Ravshanbek o’g’li, A. A. (2023). Zamonaviy dasturlash tillarining qiyosiy tahlili. Yangi O'zbekiston taraqqiyotida tadqiqotlarni o'rni va rivojlanish omillari, 2(2), 430-433.
7. Raxmonjonovich, F. S. (2023). Dasturlashda interfeyslardan foydalanishning ahamiyati. Yangi O'zbekiston taraqqiyotida tadqiqotlarni o'rni va rivojlanish omillari, 2(2), 425-429.
8. GeeksforGeeks. (n.d.). Kruskal’s Algorithm for Minimum Spanning Tree (MST). Retrieved from https://www.geeksforgeeks.org/kruskals-algorithm-for-minimum-spanning-tree/
9. Stack Overflow. (n.d.). Kruskal’s Algorithm Implementation in C#. Retrieved from https://stackoverflow.com/questions/21910216/kruskals-algorithm-implementation-in-c-sharp
