Graphs 0/61

Dijkstra and shortest paths · 2 of 4

Dijkstra

Find the distances from one source when no weight is negative by settling the closest vertex with a min-heap, and adapt the method to another measure of a path, to extra state and to counting shortest paths.

3,523 words · 16 min read

Difficulty: how hard each problem is if its topic is new to you.

Core 5

Additional practice 3