L22 BFS and DFS
Outline:
BFS
skeleton
证明: \(v.dis = \delta(s,v)\)
BFS树
应用
DFS
- s → all
Ref:
- 算法设计与分析(Algorithm design and analysis) by 黄宇
Outline:
BFS
skeleton
证明: \(v.dis = \delta(s,v)\)
BFS树
应用
DFS
Ref:
Outline:
Ref:
Outline:
Ref:
Outline:
Ref:
Outline:
Single-Sources shortest paths( SSSP )
All-pairs shortest paths( APSP )
Ref:
Outline:
Ref:
DAG(Directed Acyclic Graph), DAG's topological ordering and SCC(Strongly Connected Component).
Ref: 算法设计与分析(Algorithm design and analysis) by 黄宇.