Consider the edges in the digraph defined in exercise 4.4.4 to be undirected edges such that each edge corresponds to equal-weight edges in both directions in the edge-weighted digraph. Answer exercise 4.4.6 for this corresponding edge-weighted digraph.
Exercise4.4.4 :
Draw the (unique) SPT for source 0 of the edge-weighted digraph obtained by deleting vertex 7 from tinyEWD.txt (see page 644), and give the parent-link representation of the SPT. Answer the question for the same graph with all edge reversed.
Exercise4.4.6 :
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.