Hamilton Circuit Problem，哈密顿圈问题

Last Updated: 2024-03-13 12:53:05 Wednesday

-- TOC --

Hamilton Cycle or Circuit in a graph G is a cycle that visits every vertex of G exactly once and returns to the starting vertex.

哈密顿圈：经过图中所有顶点仅一次的环路。
Hamilton Graph is a graph which contains a Hamilton Circuit.

Hamiltonian Path in a graph G is a path that visits every vertex of G exactly once and Hamiltonian Path doesn’t have to return to the starting vertex. It’s an open path.

哈密顿路径：经过图中所有顶点仅一次的不必回到起点的路径。

本文链接：https://cs.pynote.net/ag/graph/202403111/

-- EOF --