PDF 4 Flashcards
1
Q
Dijkstra’s algorithm
A
2
Q
Proof of correctness of dijkstra’s algorithm
A
3
Q
What’s an arborescence rooted at s or the shortest path trees
A
4
Q
Algorithm: Floyd-Warshall’s algorithm
A
5
Q
Definition of DAG
A
6
Q
Property of topological ordering
A
7
Q
ALgorithm: Topological ordering method
A
8
Q
ALgorithm: shortest, longest path in DAGs
A
9
Q
What’s dynamic programming?
A
