Answer Happy

Consider the execution of the Bellman-Ford single-source shortest-path algorithm with FIFO queue on the graph given below. Vertex s is the source vertex. The vertices are given in the adjacency lists in alphabetical order. (This means, for example, that the vertices adjacent to the source vertex s are considered in the order: a, b, c.) 5 /2 14 4 -2 -5 2 7 Complete the following sentences by dragging and dropping correct choices. • In the first 4 iterations, the algorithm considers the source vertex s (in the first iteration) and its 3 neighbours (in iterations 2, 3 and 4). Recalling that the vertices are given in the adjacency lists in alphabetical order, the FIFO queue at the end of iteration 4 contains 3 vertices in the following order (from the front of the queue): • The computed shortest-path weight from the source vertex s to vertex e is equal to and and the computed shortest path from s to e has edges. • If we remove edge (a, e) from the graph, then in the modified graph the shortest path from vertex s to vertex e Junique. sabceh 4 5 7 8 9 10 |2|3|4|5|6 is is not (b)