Rare card
Shortest path problem
- Value
- 50 W
- Attack
- 257
- Defence
- 205
- Players
- 0
In graph theory, the shortest path problem is the problem of finding a path between two vertices (or nodes) in a graph such that the sum of the weights of its constituent edges is minimized.
Get Shortest path problem in your collection
Every Wikilord card is a Wikipedia article. Open packs for free, trade, battle and climb the leaderboard.
Open a free pack