English Wikipedia - The Free Encycl...
Download this dictionary
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.
See more at Wikipedia.org...
© This article uses material from
Wikipedia
®
and is licensed under the
GNU Free Documentation License
and under the
Creative Commons Attribution-ShareAlike License