After the Java bellmanFord$()$ method returns a non$-$null HashMap, each PathVertexInfo's distance attribute represents $\_\_\_\_\_.$

Question $41$ options:

the longest path from the start vertex to that vertex

the shortest path length from the start vertex to that vertex

the shortest path length from that vertex to every other vertex in the graph

the sum of all possible path lengths from the starting vertex to that vertex