1 Pass 2 3 2. [15 points] Find single source shortest path starting with source vertex 'z' use Bellman-Ford algorithm. F

[answerhappygod]

1 Pass 2 3 2 15 Points Find Single Source Shortest Path Starting With Source Vertex Z Use Bellman Ford Algorithm F 1 (82.65 KiB) Viewed 57 times

1 Pass 2 3 2. [15 points] Find single source shortest path starting with source vertex 'z' use Bellman-Ford algorithm. Follow alphabetical ordering when you visit the vertices within the list of adjacent vertices Maintain distance and predecessor information within vertex in the form [vertex, distance, predecessor] in the below. Show the list of vertices in the form [vertex, distance, predecessor] after each of the four passes in the below table. 4 S Before you begin pass 1 you should solve for all adjacent vertices of z, i.e., edges (z, x) and (z, s) that lead to two x and z. Run pass 1-4 on edges in the given order: (x, t), (s, y), (s, t), (t, x), (y, x), (t, y), (t, z), (y, z), (z, x), (z, s) 5 6 1 8 8 -4 X 8 7 List of vertices in the form [vertex, distance, predecessor] at the end of each of the four passes (list alphabetically)