Weighted path length (${\ell }_w(P)={\sum }_{e\in E(P)}w(e)$)

The weighted length of a graph path is the sum of its edge weights. With positive weights, removing a closed excursion from a walk strictly decreases its length. Hence a shortest walk between two vertices is a graph path, and minimizing weighted length is the shortest path problem.