Shortest Paths and Dijkstra's Algorithm

CS61B

Overview

C level:
3.Problem 4 from Princeton's Fall 2009 final.

4.True or false: Adding a constant to every edge weight does not change the solution to the single-source shortest-paths problem.

TRUE 错了

B level

1.(great problem) Problem 4 from Princeton's Fall 2011 final. Note that when the exam says to "relax a vertex", that mean to relax all of a vertex's edges. A similar problem is given as #6 on Princeton's SPring 2012 final.

不做了 hw和proj优先 刷完网课六月要开始刷简历项目刷题了