Let G be a directed graph with edge weights that can be negative or positive, but G has no negative weight cycles. If $d(u,v)$ denotes the weight of the shortest path from any vertex $u$ to any vertex $v$ in $G,$ then, for any three vertices $x,y,$ and $z$ of $G,$ we must have

$d(x,y)d(x,z)+d(z,y).$

True

False