Graph Theory, Traffic Analysis, Data Science, Transportation, Hands On Tutorials.
vertices in the path are neighbors, first vertex is the A, and the last is B. Path distance is the sum of the edges weights along of it. The shortest path between A and B is the path with the smallest distance. The shortest path between A and F is [A, C, E, D, F] with distance 20. [source]