1. In a weighted graph, what makes one path between two nodes a shortest path?
It has the minimum total edge weight among paths between those nodes.
Explanation
A shortest path minimizes the sum of the weights of its edges. Choosing by edge count or by a single edge does not necessarily minimize that total.