lect09 - Lecture 9 All-Pairs Shortest Paths All-Pairs...

Info iconThis preview shows pages 1–12. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

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

Unformatted text preview: Lecture 9 All-Pairs Shortest Paths All-Pairs Shortest Paths nodes. of } , { pairs all for to from path shortest find ), , ( digraph a Given t s t s E V G = Path Counting Problem nodes. of } , { pair each for to from edges exactly with paths of # count , integer positive a and ) , ( digraph a Given t s t s k k E V G = Adjacent Matrix = = = otherwise , , ) , ( if 1, and } ,..., 2 , 1 { where ) ( ) ( E j i a n V a G A ij n n ij 1 2 3 1 1 1 1 1 2 3 1 2 3 Theorem . to from edges exactly with paths of number the is element each , ) ( In ) ( j i k a G A k ij k Proof . We prove it by induction on k. 1 2 3 1 1 1 1 1 2 3 1 2 3 k =1 True! = + = n h hj k ih k ij a a a 1 ) 1 ( ) ( ) 1 ( Induction Step j h i ch oices ) ( k ih a ch o ices ) 1 ( hj a All-Pairs Shortest Paths with at most k edges . to from edges most at path with shortest the of weight the nodes, of } , { pair every for compute, , integer positive a and ) , ( digraph a Given t s k t s k E V G = Weighted Adjacent Matrix = = = otherwise , , ) , ( if , and } ,..., 2 , 1 { where ) ( ) ( E j i c l n V l G L ij ij n n ij 1 2 3 5 6 4 1 2 3 1 2 3 4 6 5 )...
View Full Document

This note was uploaded on 11/03/2010 for the course COMPUTER S CS 6363 taught by Professor Dingzhudu during the Fall '10 term at University of Texas at Dallas, Richardson.

Page1 / 26

lect09 - Lecture 9 All-Pairs Shortest Paths All-Pairs...

This preview shows document pages 1 - 12. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online