How to figure out the shortest path using dijkstra algorithm?

2 replies · 2K views · last reply
yakin
Messages
42
Reaction score
0
Attachments
  • Weighted undirected graph with vertices A through H and edge weights; question asks shortest path lengths from A to H, A to C and A to G.
    Capture.JPG
    9.6 KB · Views: 143
What have you tried? What are your thoughts on the problem, are you stuck somewhere? Could you please show a minimum of effort in your questions? :confused:
 
Bacterius said:
What have you tried? What are your thoughts on the problem, are you stuck somewhere? Could you please show a minimum of effort in your questions? :confused:

Actually, i have done my work. Just wanted to know if it is correct. Here is an image of my work.View attachment 2437
 
Attachments
  • Handwritten weighted graph with nodes A to H, edge weights, and Dijkstra labels such as 3(A), 2(AB), 5(ABF) and 7(ABDFG) beside each node, plus the set S listing A through H.
    DSC01003.JPG
    31.4 KB · Views: 155
Last edited: