Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
Shortest path problem
open-in-new
<p>In <a href="/facts/Graph_theory/VVPCd4TX">graph theory</a>, the shortest path problem is the problem of finding a <a href="/facts/Path_(graph_theory)/WMsq21Nf">path</a> between two <a href="/facts/Vertex_(graph_theory)/WhlWmL3o">vertices</a> (or nodes) in a <a href="/facts/Graph_(discrete_mathematics)/kw3eIBUe">graph</a> such that the sum of the <a href="/facts/Glossary_of_graph_theory_terms/W0MqKkyE">weights</a> of its constituent edges is minimized. </p><p>The problem of finding the shortest path between two intersections on a road map may be modeled as a special case of the shortest path problem in graphs, where the vertices correspond to intersections and the edges correspond to road segments, each weighted by the length or distance of each segment. </p>