Summary: We use Dijkstra's algorithm to find the shortest path from one node to another in a complicated house-shaped graph. Also, Vaidehi sings us a song.
Summary: We use Dijkstra's algorithm to find the shortest path from one node to another in a complicated house-shaped graph. Also, Vaidehi sings us a song.