<p>In graph theory, what is the distinction between minimal distance (which Dijkstra's algorithm finds), and minimal path (which I'm not sure what it is)?</p>

I'm not 100% sure, but it sounds like the minimal path would be the list of vertices visited when traversing the minimal distance path from vertex A to vertex B.