Shortest Path in a Directed Acyclic Graph