Some Properties of Shortest Paths
Here's an example
s
to
t
shortest path in the example graph...
What can we say about the length of any shortest path to a node
u
on the path from
s
to
t
(
)?
What can we say about the length of any shortest path to nodes
v
not
on the path from
s
to
t
(
)?
What can we say about the sequence
along a shortest path
?
Next:
Optimal Substructure Property
Up:
SHORTEST PATH PROBLEM
Previous:
Variations
)?
)?
along a
shortest path 
?
)? )? along a
shortest path ?
