slides - Computer Science - University of San Francisco
slides - Computer Science - University of San Francisco
slides - Computer Science - University of San Francisco
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
17-70: Floyd’s AlgorithmShortest n-path = Shortest pathShortest -1-path:∞ if there is no direct linkCost <strong>of</strong> the direct link, otherwiseIf we could use the shortest k-path to find theshortest (k + 1) path, we would be set