http://162.105.203.28/course/ada09/students/00748244-YT-HungaryAlgorithm.pdf（求二分图完备匹配的KM算法） http://www.cnblogs.com/penseur/archive/2013/06/16/3138981. Read More
posted @ 2015-09-01 23:29
dominating
Views(246)
Comments(0)
Diggs(0)
题意：每次给出与第i个点相邻的点，得到有向图后求哈密顿回路；参考：http://blog.csdn.net/volzkzg/article/details/7514103思路：由一点求相邻的链，构成环，再将不在环上的点加入环上，环上的点数为n时为哈密顿回路；#include #include ... Read More
posted @ 2015-09-01 23:08
dominating
Views(373)
Comments(0)
Diggs(0)
题意：给定一个邻接矩阵，即一幅有向图(有环)，问最少的覆盖路径为几条，求出遍历顺序；思路：竞赛图存在哈密顿路，一定能找到一条遍历所有点的路。#include#include#includeusing namespace std;int mm[1005][1005];char ch[1005];int... Read More
posted @ 2015-09-01 20:07
dominating
Views(198)
Comments(0)
Diggs(0)
题意：n个点n*(n-1)/2条有向边，求将每个点遍历一次的顺序，否则输出Impossible。思路：简单dfs遍历。以每个点为起点遍历，直到找出解；#include#include#includeusing namespace std;int t,n,m,temp,flag;int num[505... Read More
posted @ 2015-09-01 18:42
dominating
Views(373)
Comments(0)
Diggs(0)
浙公网安备 33010602011771号