Calculating the Shortest Path Using Dijkstra’s Algorithm
The Dijkstra's algorithm is an algorithm that determines the shortest paths needed to go from a starting node to any node in a graph. In this article, the process and results of an activity that included route formation among the provinces in the Aegean region using Dijkstra's algorithm ar...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Araştırma Temelli Etkinlik Dergisi
2018-10-01
|
| Series: | Araştırma Temelli Etkinlik Dergisi |
| Subjects: | |
| Online Access: | https://www.ated.info.tr/index.php/ated/article/view/75 |