Last Updated: 2024-04-27 03:25:43 Saturday
-- 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.
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.
据说用DFS算法可以找到Hamilton Cycle。
本文链接：https://cs.pynote.net/ag/graph/202403111/
-- EOF --
-- MORE --