Shortest Path with Dynamic Weight Implementation using Dijkstra’s Algorithm
Shortest path algorithms have been long applied to solve daily problems by selecting the most feasible route with minimum cost or time. However, some of the problems are not simple. This study applied the case using Dijkstra's algorithm on a graph representing street routes with two possible di...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Bina Nusantara University
2016-09-01
|
| Series: | ComTech |
| Subjects: | |
| Online Access: | https://journal.binus.ac.id/index.php/comtech/article/view/2534 |