23.6 Case Study: Dijkstra's Shortest Path Algorithm

• Find the shortest distance from a node on a directed graph to each other node
• A sample of routes to cities serviced by a bus company:

---

prev |top |next