Shortest Path Problem

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:

    The Gettysburg speech is at once the shortest and the most famous oration in American history. Put beside it, all the whoopings of the Websters, Sumners and Everetts seem gaudy and silly. It is eloquence brought to a pellucid and almost gem-like perfection—the highest emotion reduced to a few poetical phrases.
    —H.L. (Henry Lewis)

    Imagination places the future world for us either above or below or in reincarnation. We dream of travels throughout the universe: is not the universe within us? We do not know the depths of our spirit. M The mysterious path leads within. In us, or nowhere, lies eternity with its worlds, the past and the future.
    Novalis [Friedrich Von Hardenberg] (1772–1801)

    Our political problem now is “Can we, as a nation, continue together permanentlyforever—half slave, and half free?” The problem is too mighty for me. May God, in his mercy, superintend the solution.
    Abraham Lincoln (1809–1865)