Minimal path

A minimal path is the Path between two vertices which has the minimum weight.

In real world terms, the shortest distance.

Algorithms to compute

Back to