DFS ALGORITMI GRAFLAR VA DARAXTLAR BILAN ISHLASHDA QO‘LLANILISHI VA DFS ALGORITIMINING AHAMIYATI
Keywords:
Kalit so‘zlar: DFS algoritmi, graflar, daraxtlar, rekursiya, BFS (Breadth-First Search), rekursiv yondashuv, topologik tartib, yo‘l izlash.Abstract
Anotatsiya: Ushbu maqolada DFS algoritmi va DFS algoritmi graflar va
daraxtlar bilan ishlashda qo‘llanilishi, DFS (Depth-First Search) algoritmi daraxlar
va graflar bilan ishlashda qulayliklari, DFS Algoritmining afzalliklari, kamchiliklari
va qo`lanishi algoritmning BFS kabi boshqa algoritmlar bilan solishtirilishi ko`rib
chiqiladi.
References
Foydalanilgan adabiyotlar:
1. Ahuja, R. K., Magnanti, T. L., & Orlin, J. B. (1993). Network Flows: Theory,
Algorithms, and Applications. Prentice Hall.
2. Delling, D., Sanders, P., Schultes, D., & Wagner, D. (2009). "Engineering Route
Planning Algorithms". Algorithmics of Large and Complex Networks, 117-139.
3. Moore, E. F. (1957). "The Shortest Path through a Maze". Proceedings of an
International Symposium on the Theory of Switching, 285-292.
4. Bellman, R. (1958). "On a Routing Problem". Quarterly of Applied Mathematics,
16(1), 87-90.
5. Knuth, D.E. (1997). The Art of Computer Programming, Volume 1: Fundamental
Algorithms. Addison-Wesley.
6. Дж.Эриксон. Алгоритмы. – М.: " ДМК Пресс ", 2023. – 528 с.
7. . А. Тюкачев, В. Г. Хлебостроев. C#. Алгоритмы и структуры данных: учебное
пособие для СПО. – СПб.: Лань, 2021. – 232 с.
8. Ахо Альфред В., Ульман Джеффри Д., Хопкрофт Джон Э.
9. Структуры данных и алгоритмы. – М.: Вильямс, 2018. – 400 с.
10. Никлаус Вирт. Алгоритмы и структуры данных. Пер.с англ. Ткачев Ф. В. – М.:
ДМК Пресс, 2010. – 272 с.
11. Bellman, R. (1958). "On a Routing Problem". Quarterly of Applied Mathematics,
16(1), 87-90.
12. Hart, P. E., Nilsson, N. J., & Raphael, B. (1968). "A Formal Basis for the Heuristic
Determination of Minimum Cost Paths". IEEE Transactions on Systems Science and
Cybernetics, 4(2), 100-107.
13. Ahuja, R. K., Magnanti, T. L., & Orlin, J. B. (1993). Network Flows: Theory,
Algorithms, and Applications. Prentice Hall.
14. Moore, E. F. (1957). "The Shortest Path through a Maze". Proceedings of an
International Symposium on the Theory of Switching, 285-292.
15. Tarjan, R. E. (1972). "Depth-First Search and Linear Graph Algorithms". SIAM
Journal on Computing, 1(2), 146-160.
16. Johnson, D. B. (1977). "Efficient Algorithms for Shortest Paths in Sparse
Networks". Journal of the ACM (JACM), 24(1), 1-13.
