### Related images to shortest path problem example

In graph theory, the shortest path problem is the problem of finding a path between two vertices or nodes in a graph such that the sum of the weights of its .Dijkstra’s algorithm to find the shortest path between a and b. It picks the unvisited vertex with the lowest distance, calculates the distance through it to each .