Explore relationships

Shortest path algorithm

Computational problem of graph theoryShortest path (A, C, E, D, F), blue, between vertices A and F in the weighted directed graphIn 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 constituent edges is minimized.

Use + to expand a branch. Click a topic name to open its summary.