Shortest Path Problems

• Defined on a Network

  • Nodes, Arcs and Arc Costs
  • Two Special Nodes
    • Origin Node s
    • Destination Node t

• A path from s to t is an alternating sequence of nodes and arcs starting at s and ending at t:

s,(s,v1),v1,(v1,v2),…,(vi,vj),vj,(vj,t),t

Previous slide

Next slide

Back to first slide

View graphic version