Bellman-Ford Algorithm
Term side of the Card
Topic: Search Algorithms
Unit title: Bellman-Ford Algorithm
Categories: Algorithm
Explanation side of the Card
Explanation: The shortest-path algorithm that computes minimum distances from a starting node and can handle negative weights. Slower than Dijkstra's algorithm but useful in detecting negative cycles.