An Immediate Algorithm for DAGs

Learn about a single-source shortest-paths algorithm for directed acyclic graphs.

Looking at the idea of path-relaxation, our first fleeting thought is a wish to magically conjure an ordering of the edges so that relaxing them in that order would compute the svs - v shortest paths for all vertices vv in a digraph.

Get hands-on with 1200+ tech skills courses.