Rare card
Bellman–Ford algorithm
- Value
- 50 W
- Attack
- 267
- Defence
- 214
- Players
- 0
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. It is slower than Dijkstra's algorithm for the same problem, but more versatile, as it is capable of handling graphs in which some of the edge…
Get Bellman–Ford algorithm in your collection
Every Wikilord card is a Wikipedia article. Open packs for free, trade, battle and climb the leaderboard.
Open a free pack