algofinal

Algofinal

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: COT 6401 The Analysis of Algorithms April 25, 2000 open books and notes Final Test Name |||||||||||||- SSN |||||||||||||1. 20 For the following weighted, directed graph run FASTER-ALL-PARIS-SHORTEST-PATHS algorithm. run FLOYD-WARSHELL algorithm. 10 a d 13 2 5 9 1 b 3 c 4 i question 1, continued ii 2. 20 Modify the EXTEND-SHORTEST-PATHS and SLOW-ALL-PAIRS-SHORTESTPATHS to calculate the transitive closure of a graph. Find the transitive closure of the following graph using the modi ed algorithm. Sho...
View Full Document

This note was uploaded on 10/21/2011 for the course COT 6401 taught by Professor Staff during the Spring '09 term at FAU.

Ask a homework question - tutors are online