In Lecture 10, students learn about Dijkstra's algorithm for shortest paths in a graph with non-negative edge weights.