This preview shows page 1. Sign up to view the full content.
Unformatted text preview: (b) Describe and analyze a faster algorithm. 3. Consider a path between two vertices s and t in an undirected weighted graph G . The bottleneck length of this path is the maximum weight of any edge in the path. The bottleneck distance between s and t is the minimum bottleneck length of any path from s to t . (If there are no paths from s to t , the bottleneck distance between s and t is .) s t 1 11 7 12 8 5 10 9 2 3 6 4 The bottleneck distance between s and t is 5. Describe and analyze an algorithm to compute the bottleneck distance between every pair of vertices in an arbitrary undirected weighted graph. Assume that no two edges have the same weight. 1...
View Full Document
- Fall '08