Dijkstra for longest path in a DAG
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