Question

If vertices u and v are connected in graph G, the distance between u and v in G, denoted by d(u,v),
is the length of a shortest (u, v)-path in G; if there is no path connecting u and v we define d(u, v) to
be infinite. Show that, for any three vertices u, v and w,
d(u, v) + d (v, w)>d (, w).
​

Answer 1

Step-by-step explanation:

“Then took the other, as just as fair, And having perhaps the better claim,

Because it was grassy and wanted wear; Though as for that the passing there Had

worn them really about the same,”

(c) Explain “grassy and wanted wear”?