I am studying graph currently. I found a question, which asks for
Awhich shows shortest distances between $V$ and every other vertex
Bwhich shows shortest paths between $V$ and every other vertex
as subpoints. I don't think the question wants me to compute the same values twice, but I don't know what the difference between shortest distance and shortest path is. Can anyody explain?