(Solved) : 81 Show Arrays Look Like Djikstra S Algorithm Completes Processing Graph Shown Figure 89 P Q32813181 . . . .

8.1: Show what the arrays will look like afterDjikstra’s

algorithm completes processing the graph shown in Figure8.9 on Page 407.

Note that almost all the information you need can beinferred from Figure 8.9e

(show the contents of all three arrays: fringeWgt,parent, and status arrays).

A (partially-filled) example of the parent array is shown inFigure 8.5

at the top of Page 398. HOWEVER, this example array is forPrim’s algorithm,

not Dijkstra’s. Dijkstra uses a similar set of arrays, but withthe important

difference described on Page 410: fringeWgt[v] is now not justthe weight of

the single edge ending in v, but the weight of the entire pathfrom s to v.

The