Unformatted text preview: 2 , ··· ,S p , and each edge ( v i ,v j ) in the set of edges E is deﬁned when there is an edge between a vertex in S i and a vertex in S j . Now, prove the condensation graph G of digraph G deﬁned above is a digraph with no cycle. (b) Let G * be a graph generated by adding a new edge to any digraph G . Discuss the diﬀerence between the number of strongly connected components of G and that of G * . 3. Find the allpairs shortest path matrix for the weighted, directed graph represented by the following matrix W. Show the actions step by step (show each matrix value). W = 8 13 18 20 3 7 8 10 4 11 10 7 6 6 7 11 10 6 2 1 1...
View
Full Document
 Spring '08
 Unkown
 Algorithms, Graph Theory, strongly connected components

Click to edit the document details