Lecture Videos
Lecture 13: Dijkstra
This class discusses a fourth weighted single-source shortest path algorithm: Dijkstra’s algorithms. Non-negative edge weights are introduced. There is a worked example of applying Dijkstra’s algorithm.
Instructor: Dr. Jason Ku
Course Info
Instructors
Departments
As Taught In
Spring
2020
Level
Topics
Learning Resource Types
theaters
Lecture Videos
grading
Exams with Solutions
notes
Lecture Notes
assignment
Problem Sets
Problem Set Solutions
