DINAMIK VA STATIK GRAFLARDA ENG QISQA YO‘LNI TOPISH ALGORITMLARI
Keywords:
Dinamik graf, statik graf, Dijkstra algoritmi, A* algoritmi.Abstract
Ushbu maqolada ma’lumotlar tuzilmasining chiziqsiz turi hisoblangan garflar va ularning asosiy ikki holatida eng qisqa yo‘lni topish algoritmlari tahlili amalga oshiriladi.Tadqiqot davomida statik va dinamik graf tushunchalari, Dijkstra va A* algoritmlarining dinamik va statik holatlarda qo‘llanilishini ko‘rib chiqamiz. Eng qisqa yo‘lni topishni eng optimal algoritmlarini aniqlaymiz.
Downloads
References
1. Cormen, T. H., Leiserson, C. E., Rivest, R. L., & Stein, C. Introduction to Algorithms (3rd ed.). MIT Press, 2009.
2. Bondy, J. A., & Murty, U. S. R.Graph Theory (Graduate Texts in Mathematics, Vol. 244). Springer, 2008.
3. Diestel, R.Graph Theory (5th ed.). Springer, 2017.
4. West, D. B. Introduction to Graph Theory (2nd ed.). Prentice Hall, 2001.
5. Even, S.Graph Algorithms. Cambridge University Press, 2011.
6. Ahuja, R. K., Magnanti, T. L., & Orlin, J. B. Network Flows: Theory, Algorithms, and Applications. Prentice Hall, 1993.
7. Sedgewick, R., & Wayne, K. Algorithms (4th ed.). Addison-Wesley, 2011.
8. Chartrand, G., & Zhang, P.A First Course in Graph Theory. Dover Publications, 2012.
9. Newman, M. E. J.
Networks: An Introduction. Oxford University Press, 2010.
