Information | |
---|---|
has gloss | eng: The snake-in-the-box problem in graph theory and computer science deals with finding a certain kind of path along the edges of a hypercube. This path starts at one corner and travels along the edges to as many corners as it can reach. After it gets to a new corner, the previous corner and all of its neighbors must be marked as unusable. The path should never travel to a corner after it has been marked unusable. |
lexicalization | eng: Snake in the box |
lexicalization | eng: snake-in-the-box |
instance of | c/Computational problems in graph theory |
Media | |
---|---|
media:img | Snakeinthebox.jpg |
Lexvo © 2008-2025 Gerard de Melo. Contact Legal Information / Imprint