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

Englisch - Englisch

Definition von a path through an undirected graph which visits each vertex exactly once im Englisch Englisch wörterbuch

Hamiltonian path

Silbentrennung

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