#1
Feb2908, 12:45 PM

P: n/a

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!! 


Register to reply 
Related Discussions  
Dijkstra's algorithm  Set Theory, Logic, Probability, Statistics  0  
DFS algorithm  Programming & Computer Science  2  
Dijkstra's algorithm proof?  Engineering, Comp Sci, & Technology Homework  2  
a new algorithm?  General Math  2  
Graph Theory: Dijkstra's Algorithm  General Math  2 