This preview shows page 1. Sign up to view the full content.
Unformatted text preview: O ( k ( m + n ) log n ) by running Dijkstras algorithm k times, one for each G i where G i is the graph obtained by adding e i to G . 2. Let G be an undirected graph with non-negative edge weights. Let s and t be two vertices such that the shortest path between s and t in G contains all the vertices in the graph. For each edge e , let G \ e be the graph obtained from G by deleting the edge e . Design an O ( E log V ) algorithm that nds the shortest path distance between s and t in G \ e for all e . [ Note that you need to output E distances, one for each graph G \ e ] 3. Given a Directed Acyclic Graph (DAG) and two vertices s and t you want to determine if there is an s to t path that includes at least k vertices. 1...
View Full Document
- Fall '08