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:

    Jesus wept.
    Bible: New Testament John, 11:35.

    The shortest verse in the Bible; refers to Jesus’ grief at the death of Lazarus, whom he raised from the dead after four days.

    Round the cape of a sudden came the sea,
    And the sun looked over the mountain’s rim:
    And straight was a path of gold for him,
    And the need of a world of men for me.
    Robert Browning (1812–1889)

    The problem of culture is seldom grasped correctly. The goal of a culture is not the greatest possible happiness of a people, nor is it the unhindered development of all their talents; instead, culture shows itself in the correct proportion of these developments. Its aim points beyond earthly happiness: the production of great works is the aim of culture.
    Friedrich Nietzsche (1844–1900)