CSE 310 Programming Dijkstras & Bellman Ford Algorithms Questions

CSE 310: Summer 2023
Recitation 5 – 15 Pts
Due : Monday July 3rd 11:59 pm
Name:……………………….
ti
1. Run the Dijkstra’s algorithm for the following graph star ng from the node a. Clearly show all the
steps. No points will be given if steps are not shown
ti
2. Run the Bellman-Ford algorithm for the following graph star ng from node a. Clearly show all the
steps. No points will be given if steps are not shown.
3. Now, suppose you need to nd the single des na on shortest path to node d in the following graph
from all the nodes. Clearly explain your strategy and show all the steps.
ti
ti
fi
.