Bellman-Ford, also known as Distance-Vector Routing
Uses progressive relaxation technique
- improve path estimates as information arrives
Single source:
- initially assumes distances to all nodes are infinity, except for its immediate neighbors
- receive distance vector updates periodically
- progressively improve estimate
- (example)