Exercise: Shortest Paths in a DAG
Explore how to compute shortest paths from a selected source vertex in a directed acyclic graph. Learn to apply algorithms on weighted digraphs to identify path lengths and verify your results interactively.
We'll cover the following...
We'll cover the following...
The task at hand
Given the DAG in the playground below, select a vertex you want to serve as the source vertex. Now, grab a paper and a pen and figure out the shortest paths ...