INTERNET TARMOG'IDA ENG QISQA YO'LNI TOPISHDA FLOYD-UORSHAL ALGORITMIDAN FOYDALANISH
Keywords:
Floyd-Uorshal algoritmi, eng qisqa yo‘l, graf nazariyasi, transport tizimi, tarmoq tahlili, ijtimoiy tarmoq, ilmiy tadqiqotlar, murakkablik, algoritmik yondashuvlar, yo‘l tarmog‘i, marshrutizatsiya, dasturlash, optimallashtirish, ko‘p agentli tizimlar, real hayotdagi qo‘llanish.Abstract
Floyd-Uorshal algoritmi, graf nazariyasi sohasida eng qisqa yo‘llarni aniqlash uchun ishlatiladigan samarali va keng tarqalgan metodlardan biridir. Mazkur maqola Floyd-Uorshal algoritmining asosiy printsiplari, uning vaqt va xotira murakkabligi, dasturlashda qo‘llanishi, shuningdek, amaliyotdagi turli sohalarda, jumladan, transport, tarmoq tizimlari, ijtimoiy tarmoqlar va ilmiy tadqiqotlarda qo‘llanilishi haqida batafsil ma'lumot beradi.
References
1. Floyd, R. W. (1962). Algorithm 97: Shortest Path. Communications of the ACM, 5(6), 345.
2. Warshall, S. (1962). The Algorithmic Problem of Finding the Shortest Path. Journal of the ACM, 9(1), 15-28.
3. Dijkstra, E. W. (1959). A Note on Two Problems in Connexion with Graphs. Numerische Mathematik, 1, 269-271.
4. Tarjan, R. E. (1983). Data Structures and Network Algorithms. SIAM.
5. Papadimitriou, C. H., & Steiglitz, K. (1998). Combinatorial Optimization: Algorithms and Complexity. Prentice-Hall.
6. Kleinberg, J., & Tardos, É. (2006). Algorithm Design. Pearson.
7. Skiena, S. S. (2008). The Algorithm Design Manual (2nd ed.). Springer.
8. Koller, D., & Friedman, N. (2009). Probabilistic Graphical Models: Principles and Techniques. MIT Press.
9. Hsu, W., & Hwang, C. (1994). A Survey of Shortest Path Algorithms. Computers and Operations Research, 21(3), 305-314.
10. Miettinen, M., & Møller, P. (2004). Solving Shortest Path Problems with Multiple Constraints. European Journal of Operational Research, 154(3), 723-735.
11. Kaufman, L., & Rousseeuw, P. J. (1990). Finding Groups in Data: An Introduction to Cluster Analysis. Wiley.
12. Farmonov, S., & Nazirov, A. (2023). C# DASTURLASH TILIDA GRAY KODI BILAN ISHLASH. В CENTRAL ASIAN JOURNAL OF EDUCATION AND INNOVATION (Т. 2, Выпуск 12, сс. 71–74). Zenodo.
13. Farmonov, S., & Ergashaliyeva, B. (2024). QAT'IYMAS NEYRON TO'RLAR: MAMDANI QAT'IYMAS MANTIQIY XULOSASI, SUGENO QAT'IYMAS MANTIQIY XULOSASI. Development and innovations in science, 3(5), 62-70.
14. Farmonov, S., & Rustamova, N. (2024, May). SINFLASHNING METRIK ALGORITMLARI, YAQIN QOʻSHNI USULI VA UNI UMUMLASHTIRISH HAMDA ULARNI NEYRON TARMOQ TEXNOLOGIYALARIDA QOʻLLANILISHI. In Международная конференция академических наук (Vol. 3, No. 5, pp. 71-75).
15. Raxmonjonovich, F. S. (2024). DINAMIK DASTURLASH VA TARMOQ OQIMIDA FORD-BELMAN ALGORITMIDAN FOYDALANISH. ОБРАЗОВАНИЕ НАУКА И ИННОВАЦИОННЫЕ ИДЕИ В МИРЕ, 58(7), 13-19.
16. Raxmonjonovich, F. S. (2024). IJTIMOIY TARMOQLAR TAHLILIDA BFS ALGORITMLARI. ОБРАЗОВАНИЕ НАУКА И ИННОВАЦИОННЫЕ ИДЕИ В МИРЕ, 58(7), 20-26.
17. Raxmonjonovich, F. S., & Xurshidbek o‘g‘li, A. O. (2024). FORD-BELMAN ALGORITMI. Modern education and development, 15(4), 60-65.
18. Raxmonjonovich, F. S. (2024). KOMPYUTER TARMOQLARI SOHASIDA BITLI ALGORITMLAR. Modern education and development, 15(4), 50-59.
19. Raxmonjonovich, F. S. (2024). BIR SHAHARDAN BOSHQASIGA YUK YETKAZIB BERISHDA ENG OPTIMAL VA KAM XARAJAT SARFLANADIGAN YO’LNI TOPISHDA BELLMAN-FORD ALGORITMIDAN FOYDALANISH. Ta'lim innovatsiyasi va integratsiyasi, 34(2), 72-78.
20. Raxmonjonovich, F. S. (2024). AXBOROTLARNI SHIFRLASHDA MATEMATIK ALGORITMLARDAN FOYDALANISH. Modern education and development, 15(5), 338-344.
21. Farmonov, S. R., & qizi Oktamjonova, M. I. (2024, November). FLOYD–UORSHELL ALGORITMI. In International Conference on World Science and Resarch (Vol. 1, No. 3, pp. 32-42).
22. Farmonov, S. R. (2024). BFS ALGORITIMI ORQALI TOPOLOGIK TARTIBNI ANIQLASH. ОБРАЗОВАНИЕ И НАУКА В XXI ВЕКЕ, (56-5).
23. Raxmonjonovich, F. S. (2024). KAN ALGORITMI ASOSIDA GRAFLARDA SIKLSIZ TARTIBNI ANIQLASH. Modern education and development, 15(4), 43-49.
24. Raxmonjonovich, F. S. (2024). JONSON ALGORITMI BILAN BOG ‘LIQ MUAMMOLAR VA ULARNI YECHISH USULLARI. Modern education and development, 15(4), 32-42.
