该博客介绍了PAT甲级编程题目A1122关于寻找图中哈密顿环的问题。博客内容包括输入输出规格，样例输入输出，以及解题思路。博主提供了一个解决方案，涉及图的遍历和判断环路条件，最后展示了代码运行结果。
The "Hamilton cycle problem" is to find a simple cycle that contains every vertex in a graph. Such a cycle is called a "Hamiltonian cycle".
In this problem, you are supposed to tell if a given cycle is a Hamiltonian cycle.
Input Specification:
Each input file contains one test case. For each case, the first line contains 2 positive integers N (2<N≤200), the number of vertices, and M, the number of edges in an undirected graph. Then M lines follow, each describes an edge in the format Vertex1 Vertex2, where the vertices are numbered from 1 to N. The next line gives a positive integer K which is the number of queries, followed by K lines of queries, each in the format:
n V1 V2 ... Vn
where n is the number of vertices in the list, and Vi's are the vertices on a path.
Output Specification:
For each query, print in a line YES if the path does form a Hamiltonian cyc
最低0.47元/天 解锁文章
扫一扫
293
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
