Ignore this box please.
More
Settings
Goodies
About
Help
Feedback
PRIVACY
DontTrack
DontBubble
Policy
COMMUNITY
Platform
Forum
Chat
Spread
Search syntax
s:d sort by date
r:uk uk region
site: domain search
\ search first result
More...
r:n turn off region
!a search search amazon
site:uk uk pages
f: find files
t: within title
b: within body
More explanation...
Shortest path problem
In graph theory, the shortest path problem is the problem of finding a path between two vertices in a graph such that the sum of the weights of its constituent edges is minimized.
More at Wikipedia
Flow network
Shortest path tree
More related topics
Euclidean shortest path
Min-plus matrix multiplication
Polynomial-time problems
Network theory
Computational problems in graph theory
Graph algorithms
This page requires Javascript.Get the non-JS version
here
.