Today we went over Dijkstra's algorithm for finding the shortest path from a source vertex to all other vertices in a weighted graph. Try to finish implementing this algorithm in your spare time as practice. As always, there are three USACO problems that you can work on: a bronze one, http://www.usaco.org/index.php?page=viewproblem2&cpid=891; a silver one, http://www.usaco.org/index.php?page=viewproblem2&cpid=191; and finally another more challenging silver one, http://www.usaco.org/index.php?page=viewproblem2&cpid=398. You might notice that the bronze problem isn't related to what we learned in class this time; instead, it is just a problem for those of you who choose to want to do bronze practice instead of silver practice.

To see this working, head to your live site.

Search

kevinzhao183

Jul 19, 2020

· Edited: Jul 19, 2020# 7/19 Weekly Post

7/19 Weekly Post

0 comments

0