@ravishah
Computer Science · Georgia Tech · Class of 2027
Joined September 2025
Dijkstra's finds the cheapest path from one start vertex to every other vertex, as long as no edge weight is negative. The plain-English version: 1. Everyone starts infinitely far away, except the start, at distance 0. 2. Repeatedly pick the unvisited vertex w…
11 hrs/week7/10 difficultyWould take again
I took this alongside two other technical classes and it was manageable, but only because I started every assignment the day it came out. The difficulty comes in waves. The first few weeks feel fine, the tree and heap weeks are the steepest, and hashing and so…