2023-11-29

Introduction

Summary

keywords

TODO

HW

Exercise*

Next time

---

Dijkstra's Algorithm

Single Source shortest path problem

The shortest path weight from a selected source node to the each other nodes.

• initialize the not-directly-connected paths with infinity.

• Relaxation : exchanging/taking the less costed path.