×
Please click
here
if you are not redirected within a few seconds.
All
Videos
Images
Books
Maps
News
Shopping
Search tools
Any time
Any time
Past hour
Past 24 hours
Past week
Past month
Past year
All results
All results
Verbatim
Shortest path problem
<
>
View all
In graph theory, the shortest path problem is the problem of finding a path between two vertices in a graph such that the sum of the weights of its constituent edges is minimized.
Wikipedia