2 docs tagged with "Dijkstra"

Learn essential graph algorithms including Dijkstra, Bellman-Ford, topological sort, and minimum spanning trees using Kruskal and Prim algorithms.

Master practical heap applications including top-K problems, running median, merging sorted lists, and Dijkstra's algorithm.