Question

(30 Points) In this problem, you are tasked with determining the shortest paths from node a to all other nodes in the network shown in the figure below. You should use Dijkstra's algorithm for calculating the shortest paths. Use the csv file that came in the archive or at http://www.ecs.umass.edu/ece241/documents/hw4 q3.csv as template to provide your solution and submit the file with your solution to gradescope. 3 Swi SX
​​​​​​​

Answer 1

step	N	D(v),p(v)	D(W),P(W)	D(X),P(X)	D(Y),P(Y)	D(Z),P9Z)
0	u	2,U	INFINITY	1,U	INFINITY	INFINITY
1	x	2,U	4,X		2,X	INFINITY
2	v		4,X		2,X	INFINITY
3	y		3,Y			4,Y
4	w					4,Y
5	z