This is a type of algorithm used to find the shortest distance between vertices in a graph. There are many kinds, but the most common are Floyd-Warshall, Dijkstra’s and Bellman-Ford.