FLOYD – UORSHELL ALGORITMI
Keywords:
Uorshell algoritimi, sun’iy intellekt, grafda harakat,kenglik bo’yicha qidiruv, eng qisqa yo’l topish.Abstract
Ushbu maqolada Uorshell algoritimidan foydalanish mumkin bo’lgan sohalar, shu sohalardagi qo’llash mumkin bo’lgan o’rinlar keltirilgan bo’lib sun’iy intellekt va mashinalar bilan ishlashga doir misol va masalalarni Uorshell algoritimi yordamida samarali yechish va tahlil qilish ko’rib chiqilgan.
References
Knuth, D.E. (1997). The Art of Computer Programming, Volume 1: Fundamental Algorithms. Addison-Wesley.
Aho, A.V., Hopcroft, J.E., & Ullman, J.D. (1974). The Design and Analysis of Computer Algorithms. Addison-Wesley.
Mehlhorn, K., & Sanders, P. (2008). Algorithms and Data Structures: The Basic Toolbox. Springer.
Sedgewick, R., & Wayne, K. (2011). Algorithms. Addison-Wesley Professional.
Even, S. (2011). Graph Algorithms. Cambridge University Press.
Kleinberg, J., & Tardos, E. (2006). Algorithm Design. Addison-Wesley.
Tarjan, R.E. (1983). Data Structures and Network Algorithms. Society for Industrial and Applied Mathematics.
Eppstein, D., Galil, Z., Italiano, G.F., & Spencer, T. (1997). "Separator-Based Parallel Algorithm for the Single-Source Shortest Path Problem," Journal of Algorithms, 23(1), 122-145.
Valiant, L.G. (1990). "A Bridging Model for Parallel Computation," Communications of the ACM, 33(8), 103-111.
Papadimitriou, C.H. (1994). Computational Complexity. Addison-Wesley.
Alon, N., & Spencer, J.H. (2008). The Probabilistic Method. Wiley.
