This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: L j : all nodes at distance j from s L j : all nodes at distance j from s Exercise for you Prove that L j has all nodes at distance j from s BFS Tree BFS naturally defines a tree rooted at s L j forms the j th “level” in the tree u in L j+1 is child of v in L j from which it was “discovered” 1 1 2 2 3 3 4 4 5 5 6 6 7 7 8 8 1 1 2 2 3 3 L L 1 4 4 5 5 7 7 8 8 L 2 6 6 L 3 Add nontree edges Add nontree edges Connected Component Connected component (of s ) is the set of all nodes connected to s Algo to compute the connected component of s ? Today’s agenda Every edge in is between consecutive layers Computing Connected component...
View
Full Document
 Fall '11
 RUDRA
 Graph Theory, Lj, connected component, shortest length path, distinct vertex sequences

Click to edit the document details