Dijkstra's Algorithm for finding the shortest path through a weighted graph. This video runs through 3 examples of the table method of Dijkstra's Algorithm.
Thank you so much for this wonderfull exaplanation! I was trying to follow along with the cambridge textbook example but there were just somethings that wernt explain very well such as putting in the already connect weight for a vertex when there is no direct connection from the row vertex. You did such a great job explain this method, I finally understand it now.
Thank you very much. I have been searching for a video that explains the backtracking, most channels just tell you the route without showing how to derive it from the table. I was solving the table and was using another method to find the route via the diagram as I didn't know how to backtrack. Also my exam is 6 hours.