Back to Discover
🔢

Bellman–Ford algorithm

math Maturity 7-9

We want to find the best way to go.

Bellman-Ford worst-case example.svg
Bellman-Ford worst-case example.svg
You can find the shortest path. It looks at all the ways to go. This helps you find the best way. It works even when things change. Do you like finding the best way?

46 words
🖼️ Images & Media (1)
File:Bellman-Ford worst-case example.svg
Bellman-Ford worst-case example.svg
Up Next
🔢
Dijkstra's algorithm
Math
More to explore