Determine the shortest path in a graph from a source node O to a sink node T.
Shortest path algorithms can be classified as follows:
Tree algorithms: determine the shortest path between two nodes (Dijkstra, Bellman).
Methods that determine the shortest path from all nodes to all other nodes (distance matrix!). (Triple algorithm)