← Back to USACO
Shortest Paths (Dijkstra)

Shortest Paths (Dijkstra)

Priority queues, edge relaxation, and weighted graphs.

Theory and curriculum notes for this chapter are currently being written. Check back soon.