c++ - 在网格图中找到哈密顿循环[关闭](Finding Hamiltonian cycle in a grid graph [closed])

Question

Closed) . 已关闭) 。) This question needs details or clarity . 这个问题需要细节或说明 。) It is not currently accepting answers. 它当前不接受答案。)

---

Want to improve this question?)

(想改善这个问题吗？))

Add details and clarify the problem by editing this post .

(添加详细信息并通过编辑此帖子来澄清问题。)

Closed 2 hours ago .

(2小时前关闭。)

I have a grid graph with 30 rows and 30 columns.

(我有一个30行30列的网格图。)

How do I implement the algorithm for finding the Hamiltionian cycle (in c++ possibly)?

(如何实现查找汉密顿循环的算法（可能在C ++中）？)

One, so that it returns a 30*30 grid, in every cell a value from 0-899, so I can track the path (it goes from 0 to 1, from 1 to 2).

(一个，这样它返回一个30 * 30的网格，在每个单元格中，其值为0-899，因此我可以跟踪路径（它从0到1，从1到2）。)

  ask by yomag1234 translate from so

Answer 1

等待大神答复