|
|
Definition of Hamiltonian path
1. Noun. (graph theory) A path through an undirected graph which visits each vertex exactly once. ¹
¹ Source: wiktionary.com
Lexicographical Neighbors of Hamiltonian Path
Other Resources:
|
|
1. Noun. (graph theory) A path through an undirected graph which visits each vertex exactly once. ¹
¹ Source: wiktionary.com