I thought about the problem and I think it is not possible in general. Being acyclic is not enough, I think. For example: We want to go from a to c in this dag. a – > b – > c | /\ v | d – – – – – d-c has length 4 … Read more
As long as the graph does not contain a negative cycle (a directed cycle whose edge weights have a negative sum), it will have a shortest path between any two points, but Dijkstra’s algorithm is not designed to find them. The best-known algorithm for finding single-source shortest paths in a directed graph with negative edge … Read more