Bellman–Ford algorithm
>
The Bellman–Ford algorithm is an algorithm that computes shortest paths from a single source vertex to all of the other vertices in a weighted digraph. Wikipedia
Class: Single-source shortest path problem (for weighted directed graphs)
Data structure: Graph