Breadth-first algoritmi va Dijkstra algoritmining farqlari.

Saidmurotov Sulaymon Ollaberganovich; Ollaberganov Mirzohid Ollaberganovich; Frunzayeva Dilfuza Axmad qizi; Azizbek Sultonboyev Umarjon o'g'li

Vol. 1 No. 2 (2023), Articles

Vol. 1 No. 2 (2023)

Breadth-first algoritmi va Dijkstra algoritmining farqlari.

Articles

Published 2023-02-05

Saidmurotov Sulaymon Ollaberganovich⁺⁻
Ollaberganov Mirzohid Ollaberganovich⁺⁻
Frunzayeva Dilfuza Axmad qizi⁺⁻
Azizbek Sultonboyev Umarjon o'g'li⁺⁻

Saidmurotov Sulaymon Ollaberganovich

TATU Urganch filiali 2-bosqich talabasi

Ollaberganov Mirzohid Ollaberganovich

TATU Urganch filiali 2-bosqich talabasi

Frunzayeva Dilfuza Axmad qizi

TATU Urganch filiali 2-bosqich talabasi

Azizbek Sultonboyev Umarjon o'g'li

TATU Urganch filiali 2-bosqich talabasi

PDF

DOI

Keywords

algoritm, grafika, navigatsiya, robot.

How to Cite

Breadth-first algoritmi va Dijkstra algoritmining farqlari. (2023). Journal of Universal Science Research, 1(2), 446-448. https://universalpublishings.com/index.php/jusr/article/view/254

Abstract

Ushbu maqolada Breadth-first va Dijkstra algoritmining farqlari haqida bayon etilgan. Bu ikkita algoritmni taqqoslash orqali ikkala algoritmni chuqurroq tadqiq etishga harakat qildik.

PDF

DOI