Rare card
Hamiltonian path problem
- Value
- 50 W
- Attack
- 745
- Defence
- 596
- Players
- 0
The Hamiltonian path problem is a topic discussed in the fields of complexity theory and graph theory. It decides if a directed or undirected graph, G, contains a Hamiltonian path, a path that visits every vertex in the graph exactly once.
Get Hamiltonian 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