a path through an undirected graph which visits each vertex exactly once

listen to the pronunciation of a path through an undirected graph which visits each vertex exactly once
English - English
Hamiltonian path
a path through an undirected graph which visits each vertex exactly once

    Hyphenation

    a path through an un·di·rec·ted graph which visits each ver·tex ex·act·ly once

    Pronunciation

Favorites
More...
Clear