Question: Exercise 7.3 (Shortest routes) (4 + 2 = 6 points) 1. Calculate the shortest path of in each of the two graphs given a after

Exercise 7.3 (Shortest routes) (4 + 2 = 6 points) 1. Calculate the shortest path of in each of the two graphs given a after e, by doing You apply the Dijkstra algorithm to one graph and the Bellman - Ford algorithm to the other graph. Think about which algorithm it makes sense to use for which graph. In each step, explicitly state what information about the nodes is to be saved. For the Bellman - Ford algorithm, process the edges in "alphabetical descending order". That means you walk each knot from e after a and the neighbors of the respective node work again from e after a from. 6th 6th 3 1 7th 1 7th 2nd 5 6th 6th 2 3 Graph 1 Graph 2
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
