1. A delivery route between two network vertices is considered a shortest path when what condition is met?
Its total edge weight is minimal among routes between the vertices
Explanation
A shortest path minimizes the sum of the weights of its edges; having fewer edges or a light final edge does not by itself guarantee the smallest total weight.