In graph theory, the **shortest path problem** is the problem of finding a path between two vertices (or nodes) in a graph such that the sum of the weights of its constituent edges is minimized.

This is analogous to the problem of finding the shortest path between two intersections on a road map: the graph's vertices correspond to intersections and the edges correspond to road segments, each weighted by the length of its road segment.

Read more about Shortest Path Problem: Definition, Algorithms, Roadnetworks, Applications, Related Problems, Linear Programming Formulation

### Famous quotes containing the words shortest, path and/or problem:

“I have simplified my politics into an utter detestation of all existing governments; and, as it is the *shortest* and most agreeable and summary feeling imaginable, the first moment of an universal republic would convert me into an advocate for single and uncontradicted despotism. The fact is, riches are power, and poverty is slavery all over the earth, and one sort of establishment is no better, nor worse, for a people than another.”

—George Gordon Noel Byron (1788–1824)

“We are the pioneers of the world; the advance-guard, sent on through the wilderness of untried things, to break a new *path* in the New World that is ours.”

—Herman Melville (1819–1891)

“I don’t have any *problem* with a reporter or a news person who says the President is uninformed on this issue or that issue. I don’t think any of us would challenge that. I do have a *problem* with the singular focus on this, as if that’s the only standard by which we ought to judge a president. What we learned in the last administration was how little having an encyclopedic grasp of all the facts has to do with governing.”

—David R. Gergen (b. 1942)