| Title: | Shortest path problem for nearly acyclic directed graphs : final project paper |
|---|
| Authors: | ID Lazarevska, Marija (Author)
ID Požar, Rok (Mentor) More about this mentor... 
ID Brodnik, Andrej (Comentor) |
|---|
| Files: |  DIP_Lazarevska_Marija_2025.pdf (269,47 KB)
MD5: 04602CD541891AC849DFD480CE4AFA59
|
|---|
| Language: | English |
|---|
| Work type: | Final paper |
|---|
| Typology: | 2.11 - Undergraduate Thesis |
|---|
| Organization: | FAMNIT - Faculty of Mathematics, Science and Information Technologies
|
|---|
| Keywords: | algorithm, shortest path, nearly acyclic graph, directed graph, Dijkstra’s algorithm, priority queue, Fibonacci heap |
|---|
| Place of publishing: | Koper |
|---|
| Place of performance: | Koper |
|---|
| Publisher: | M. Lazarevska |
|---|
| Year of publishing: | 2025 |
|---|
| Year of performance: | 2025 |
|---|
| Number of pages: | 1 spletni vir (1 datoteka PDF (VII, 22 str.)) |
|---|
| PID: | 20.500.12556/RUP-21899 |
|---|
| UDC: | 519.17 |
|---|
| COBISS.SI-ID: | 252814595 |
|---|
| Note: | Sistemske zahteve: Adobe Acrobat Reader |
|---|
| Publication date in RUP: | 13.10.2025 |
|---|
| Views: | 282 |
|---|
| Downloads: | 4 |
|---|
| Metadata: |    |
|---|
|
:
|
Copy citation |
|---|
| | | | Average score: | (0 votes) |
|---|
| Your score: | Voting is allowed only for logged in users. |
|---|
| Share: |  |
|---|
Hover the mouse pointer over a document title to show the abstract or click
on the title to get all document metadata. |
