資源簡介
最短哈密頓回路,在無向圖中由一個頂點出發,不重復的遍歷所有頂點,最后回到出發點,找到最短的回路,用C語言實現,
代碼片段和文件信息
#include?
#include
#include“stdio.h“
#include?
#include?
#include
#include?
#include?
#define?L?1???
#define?N?20?
#pragma?comment(lib“WINMM.LIB“)
#define?MAX_VALUE?10000
using?namespace?std;
class?wndbgn
{
private:
int?qess;
int?efsfcsc[N]wbngjgf[N];
int?c[N][N];
int?k;
public:
wndbgn(int?b[N][N])
{????
k=0;
for(int?i=0;i {??
efsfcsc[i]=-1;
for(int?j=0;j c[i][j]=b[i][j];
}
qess=MAX_VALUE;
}
void??opwbngjgf(int?n?int?lon)
{??
???if(n==N)
???{??
???if(efsfcsc[N-1]==L-1&&?qess>iokgb())
???{???
???qess=iokgb();
???for(int?i=0;i ???????????????wbngjgf[i]=efsfcsc[i];
???}
???}
???else?if(n==0)
???{
???for(int?i=0;i
?屬性????????????大小?????日期????時間???名稱
-----------?---------??----------?-----??----
?????文件?????548962??2010-10-03?12:58??最短哈密頓回路\Debug\hamilton.exe
?????文件?????791336??2010-10-03?12:58??最短哈密頓回路\Debug\hamilton.ilk
?????文件?????207469??2010-10-03?12:58??最短哈密頓回路\Debug\hamilton.obj
?????文件????2029956??2010-10-03?12:58??最短哈密頓回路\Debug\hamilton.pch
?????文件????1123328??2010-10-03?12:57??最短哈密頓回路\Debug\hamilton.pdb
?????文件?????336896??2010-10-03?12:58??最短哈密頓回路\Debug\vc60.idb
?????文件?????167936??2010-10-03?12:58??最短哈密頓回路\Debug\vc60.pdb
?????文件??????17689??2010-10-03?12:58??最短哈密頓回路\Debug\貨郎擔限界算法.obj
?????文件???????5077??2010-10-03?12:57??最短哈密頓回路\hamilton.cpp
?????文件???????3425??2010-10-03?12:58??最短哈密頓回路\hamilton.dsp
?????文件????????524??2010-10-03?12:59??最短哈密頓回路\hamilton.dsw
?????文件??????58368??2010-10-03?12:59??最短哈密頓回路\hamilton.ncb
?????文件??????48640??2010-10-03?12:59??最短哈密頓回路\hamilton.opt
?????文件????????756??2010-10-03?12:58??最短哈密頓回路\hamilton.plg
?????目錄??????????0??2010-10-09?15:26??最短哈密頓回路\Debug
?????目錄??????????0??2010-10-09?15:26??最短哈密頓回路
-----------?---------??----------?-----??----
??????????????5340362????????????????????16
- 上一篇:拓撲算法的C語言實現完全代碼
- 下一篇:小波濾波和小波包程序
評論
共有 條評論