Jo‘raboyeva, Oydina (2025) DINAMIK VA STATIK GRAFLARDA ENG QISQA YO‘LNI TOPISH ALGORITMLARI. PROBLEMS AND SOLUTIONS OF SCIENTIFIC AND INNOVATIVE RESEARCH; Vol. 2 No. 6 (2025): Turkish Conference on Problems and Solutions of Scientific and Innovative Research; 148-152.
![[thumbnail of 7561.pdf]](https://universalpublishings.uz/style/images/fileicons/application_pdf.png)
PDF
7561.pdf - Published Version
Download (612kB)
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.
| Item Type: | Article |
|---|---|
| Additional Information: | Imported from Problems and Solutions of Scientific and Innovative Research |
| SWORD Depositor: | Admin User |
| Depositing User: | Admin User |
| Date Deposited: | 25 Sep 2026 22:23 |
| Last Modified: | 25 Sep 2026 22:23 |
| URI: | https://universalpublishings.uz/id/eprint/10808 |
Actions (login required)
- View Item