Let $G$ be a dynamic DAG (directed acyclic graph) where new vertices and new edges can be inserted.I am looking for an efficient data structure/algorithm to maintain the shortest path from a fixed vertex $s$ to a fixed vertex $t$ in $G$.
Dynamic shortest path data structure for DAG
ds.algorithms;graph theory;ds.data structures;directed acyclic graph;shortest path