Detailed explanation of Dijkstra, Bellman-Ford, and Floyd-Warshall algorithms used to find the shortest path on graphs based on minimum distance rules. Developed in the 1950s by renowned mathematicians