Scribd
Upload
36 views1 page

AlgoBook Cormen ShortestPathVariants

This document discusses variants of the single-source shortest path problem in graph algorithms. It describes the single-destination, single-pair, and all-pairs shortest path problems and how they can be reduced to or solved using the single-source shortest path problem. The all-pairs shortest path problem, which finds shortest paths between all pairs of vertices, is addressed in more detail in another chapter.

Uploaded by

Deez Nuts
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
36 views1 page

AlgoBook Cormen ShortestPathVariants

This document discusses variants of the single-source shortest path problem in graph algorithms. It describes the single-destination, single-pair, and all-pairs shortest path problems and how they can be reduced to or solved using the single-source shortest path problem. The all-pairs shortest path problem, which finds shortest paths between all pairs of vertices, is addressed in more detail in another chapter.

Uploaded by

Deez Nuts
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

< Day Day Up >

Variants
In this chapter, we shall focus on the single-source shortest-paths
problem: given a graph G = (V, E), we want to find a shortest path from
a given source vertex s V to each vertex v V . Many other
problems can be solved by the algorithm for the single-source problem,
including the following variants.

Single-destination shortest-paths problem: Find a shortest


path to a given destination vertex t from each vertex v. By
reversing the direction of each edge in the graph, we can
reduce this problem to a single-source problem.

Single-pair shortest-path problem: Find a shortest path from


u to v for given vertices u and v. If we solve the single-source
problem with source vertex u, we solve this problem also.
Moreover, no algorithms for this problem are known that run
asymptotically faster than the best single-source algorithms in
the worst case.

All-pairs shortest-paths problem: Find a shortest path from


u to v for every pair of vertices u and v. Although this problem
can be solved by running a single-source algorithm once from
each vertex, it can usually be solved faster. Additionally, its
structure is of interest in its own right. Chapter 25 addresses
the all-pairs problem in detail.

< Day Day Up >

You might also like