This article includes a list of general references, but it lacks sufficient corresponding inline citations. (June 2009) |
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.
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 of the segment.
© MMXXIII Rich X Search. We shall prevail. All rights reserved. Rich X Search