1 votes 1 votes If we run Dijkstra’s algorithm to find single source shortest path for the above edge weighted directed graph with ‘8’ as source. In what order do the nodes get included into the set of vertices for which the shortest path distances are finalized. Algorithms dijkstras-algorithm algorithms shortest-path + – Warlock lord asked Sep 14, 2017 • edited Sep 14, 2017 by Warlock lord Warlock lord 1.5k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
2 votes 2 votes 8,5,6,2,3,4,1,9,11,7,10,13,14,12 just remember property that if two relaxed items have same value than we will extract the first one which was inserted in queue. Red_devil answered Sep 15, 2017 • edited Sep 15, 2017 by Red_devil Red_devil comment Share Follow See all 3 Comments See all 3 3 Comments reply Warlock lord commented Sep 15, 2017 reply Follow Share Okay I just wanted to know did you draw a table to find a solution or just traced the graph? Because drawing a table and solving takes a lot of time for a big graph like this. Can you show me your solution? 0 votes 0 votes Red_devil commented Sep 15, 2017 reply Follow Share Yes i drew the graph but it will not take much time,just write the relaxed edges value on vertex and each time update it. 0 votes 0 votes Mayankprakash commented Jan 3, 2019 reply Follow Share @Red_devil @Warlock lord please tell why after 8,5.. 6 is added as 1 has less weight than 6. we always choose node with least weight among available nodes. 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes 8-11-13-12,,,8-9...8-5-4-1....8-5-7-10-12...8-5-6-3...8-5-2 ???? hs_yadav answered Sep 14, 2017 hs_yadav comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes 8 > 5>6>2>3 or 4>4 or 3>1>9>7 or 11> 11 or 7>10>13>14>12 raju paul answered Jul 5, 2019 raju paul comment Share Follow See all 0 reply Please log in or register to add a comment.
