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

الإنجليزية - الإنجليزية

تعريف a path through an undirected graph which visits each vertex exactly once في الإنجليزية الإنجليزية القاموس.

Hamiltonian path

الواصلة

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