Algorithms to find the shortest path between two nodes, such as Dijkstra's Algorithm and Bellman-Ford Algorithm.