Understanding Acyclic Edge-Weighted Digraphs

It is easier to find shortest paths in an edge-weighted digraph that has no directed cycles than general digraph.