该博客介绍了如何使用Python解决图论问题中的Hamiltonian Cycle，详细阐述了输入输出规格，并提供了样例输入输出。内容包括问题解释、Python代码实现，以及针对给定路径判断是否构成Hamiltonian Cycle的查询处理。
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
扫一扫
356
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
