hdoj 3435 A new Graph Game 【无向图判断权值最小哈密顿环】【KM算法】

最新推荐文章于 2020-06-15 23:19:06 发布

原创

最新推荐文章于 2020-06-15 23:19:06 发布 · 1.8k 阅读

3 ·

CC 4.0 BY-SA版权

该博客讨论了一个图论问题，寻找是否存在具有最小权值的哈密顿环。作者提到在面对这类问题时，传统的费用流算法可能导致超时，而采用KM算法可以有效地解决问题并实现AC（Accepted）状态。文章中，作者分享了使用KM算法解决此类问题的经验，并表示未来将优先考虑使用KM算法来处理类似题目。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

A new Graph Game

Time Limit: 8000/4000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1934 Accepted Submission(s): 827

Problem Description

An undirected graph is a graph in which the nodes are connected by undirected arcs. An undirected arc is an edge that has no arrow. Both ends of an undirected arc are equivalent--there is no head or tail. Therefore, we represent an edge in an undirected graph as a set rather than an ordered pair.
Now given an undirected graph, you could delete any number of edges as you wish. Then you will get one or more connected sub graph from the original one (Any of them should have more than one vertex).
You goal is to make all the connected sub graphs exist the Hamiltonian circuit after the delete operation. What’s more, you want to know the minimum sum of all the weight of the edges on the “Hamiltonian circuit” of all the connected sub graphs (Only one “Hamiltonian circuit” will be calculated in one connected sub graph! That is to say if there exist more than one “Hamiltonian circuit” in one connected sub graph, you could only choose