Note

CS Degree Day 52

CS Degree in 100 Days

31 Jul'25

What I did today?

Lecture 13: Weighted graphs, Dijkstra’s algorithm
Lecture 14: Bellman-Ford algorithm (handles negative weights)
Problem set: Implement Dijkstra’s

Dijkstra is another popular name that I heard previously.
Dijkstra’s implementation took me three hours. The priority queue details - decrease-key operations, lazy deletion - are finicky. My first implementation was correct but O(V²). The heap-based version took another hour.

I am learning that the gap between understanding an algorithm and implementing it efficiently is huge.

Back to notes Return home