Week 12. Shortest Path

13.1 Algorithms

Learn (1) proofs and (2) complexity for Dijkstra’s Algorithm.

Graph Algorithm Problems

1.

DFT and BFT

2.

Topological Sort

3.

Transitive Closure

4.

Shortest Path

5.

Spanning Tree