Question: For k 1 , if the path has k as an intermediate vertex, so that it is i k j where ? b a r

For k1, if the path has k as an intermediate vertex, so that it is ikj
where ?bar(k)j, then choose as the predecessor of j on this path the same vertex
as the predecessor of j chosen on a shortest path from k with all intermediate
vertices in the set {1,2,dots,k-1}. Otherwise, when the path from i to j does not
have k as an intermediate vertex, choose the same predecessor of j as on a shortest
path from i with all intermediate vertices in the set {1,2,dots,k-1}. Formally, for
k1,
ij(k)={kj(k-1)ifdij(k-1)>dik(k-1)+dkj(k-1)(kisanintermediatevertex),ij(k-1)ifdij(k-1)dik(k-1)+dkj(k-1)(kisnotanintermediatevertex).
23.2-5
Consider the following change to how equation (23.8) handles equality:
For k 1 , if the path has k as an intermediate

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Programming Questions!