Applying Dijkstras Algorithm in Routing Process
Citations
20 citations
Cites methods from "Applying Dijkstras Algorithm in Rou..."
...One of the studies in previous research [15] suggests that Dijkstra's algorithm was once used for finding food ingredients by providing the shortest path to users by using the greedy approach to solve problems....
[...]
12 citations
Additional excerpts
...The Dijkstra algorithm flowchart (source: [30])....
[...]
...The Dijkstra algorith flo chart (source: [30])....
[...]
5 citations
Cites background from "Applying Dijkstras Algorithm in Rou..."
...It works by finding the lowest cost between the source node and every other node presents in the network (Gupta et al., 2016)....
[...]
4 citations
Cites background from "Applying Dijkstras Algorithm in Rou..."
...Dijkstra’s algorithm runs iteratively and shows the shortest path to the filled trash can [14,15]....
[...]
4 citations
Cites background from "Applying Dijkstras Algorithm in Rou..."
...The algorithm finds the shortest path between source node and all other nodes in the network [18]....
[...]
References
140 citations
20 citations
17 citations
"Applying Dijkstras Algorithm in Rou..." refers background in this paper
...Edge cost is the term used for the value between two vertices [5,6]....
[...]
...each step that is taken and how Distance is measured [5,6]....
[...]
12 citations
7 citations