Breadth-first algoritmi va Dijkstra algoritmining farqlari.

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

doi:10.5281/zenodo.7665389

Published February 22, 2023 | Version v1

Journal article Open

Breadth-first algoritmi va Dijkstra algoritmining farqlari.

1. TATU Urganch filiali 2-bosqich talabasi

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

Files

Saidmurotov Sulaymon 446-448 JUSR.pdf

Files (618.9 kB)

Name	Size	Download all
Saidmurotov Sulaymon 446-448 JUSR.pdf md5:4fe2f94cbd2cf0c722f3defc1d6fad54	618.9 kB	Preview Download

Additional details

Citations

Oops! Something went wrong while fetching results.

Views

Downloads

Show more details

	All versions	This version
Views	74	74
Downloads	46	46
Data volume	29.1 MB	29.1 MB

More info on how stats are collected....

DOI

Resource type

Journal article

Publisher

Zenodo

Published in

JOURNAL OF UNIVERSAL SCIENCE RESEARCH, 1(2), 446-448, 2023.

Languages

Uzbek

Creative Commons Attribution 4.0 International

The Creative Commons Attribution license allows re-distribution and re-use of a licensed work on the condition that the creator is appropriately credited. Read more

Technical metadata

Created: February 22, 2023
Modified: July 12, 2024

Breadth-first algoritmi va Dijkstra algoritmining farqlari.

Creators

Description

Files

Saidmurotov Sulaymon 446-448 JUSR.pdf

Files (618.9 kB)

Additional details

References