shortest_path_dag (235B)
1 # Shortest path DAG 2 3 The *shortest path DAG* for a [graph] G and [vertices] s and t is the [DAG] of the [vertices] and [edges] that can occur in a [shortest_path] between s and t (assuming positive [edge_weights]) 4 5 Up: [shortest_path]