Give a trace that shows the process of computing the SPT of the digraph defined in exercise 4.4.5 with the eager version of Dijkstra’s algorithm.
Exercise4.4.5 :
Change the direction ofedge 0->2 in tinyEWD.txt (see page 644). Draw two different SPTs that are rooted at 2 for this modified edge-weighted digraph.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.