1. Consider the graph we have been using throughout this section, except change the weight of the edge that goes from 0 to 5. Its new weight is 4. Go through the entire algorithm to compute the new distance array.
2. Compute the complete predecessor array for the previous exercise and use it to find the actual shortest path from vertex 0 to vertex 3.
Already registered? Login
Not Account? Sign up
Enter your email address to reset your password
Back to Login? Click here