Last Updated：2025/11/23

(graph theory) A Hamiltonian path with an additional connection between the first and last vertices visited, forming a cycle.

音声機能が動作しない場合はこちらをご確認ください

See correct answer

Hamiltonian cycle

Source Word

Hamiltonian cycle

(graph theory) A Hamiltonian path with an additional connection between the first and last vertices visited, forming a cycle.

Japanese Meaning

グラフ理論において、すべての頂点を一度ずつ訪問し、最初の頂点に戻る閉路（ハミルトン閉路）を指す。

The algorithm efficiently found a Hamiltonian cycle that visits every vertex exactly once and returns to the starting point.

そのアルゴリズムは、各頂点をちょうど一度ずつ訪れて出発点に戻るように、最初と最後の頂点が辺で結ばれたハミルトン路（ハミルトン閉路）を効率的に見つけた。

Sense（1）

(graph theory) A Hamiltonian path with an additional connection between the first and last vertices visited, forming a cycle.

Hamiltonian cycles

（ plural ）