Dijkstra's Algorithm

*Jas*

Hi

The purpose of this question is to find the shortest path from nodes c to f.

I have attached the question using the below headings:

1. The problem statement, all variables and given/known data

An image showing a graph can be seen in the attachment

2. Relevant equations


3. The attempt at a solution

A table can be seen under this heading showing my attempt at the question...however im not sure whether it is accurate!
so any help...in order to improve what i currently have would be very much appreciated!!

Attached Files

da_table.doc (42.5 KB, 14 views)