Shortest path

A shortest path from $u$ to $v$ is any path $p$ from $u$ to $v$ with weight $w(p)=\delta (u,v)$.