資源簡(jiǎn)介
本算法解決了如何構(gòu)造一個(gè)歐拉圖的問題,在構(gòu)造完歐拉圖后如何去尋找一個(gè)歐拉回路。
代碼片段和文件信息
//?eulargraph.cpp?:?Defines?the?entry?point?for?the?console?application.
//
#include?“stdafx.h“
#include?“stdio.h“
#include?“stdlib.h“
#include?“time.h“
#include?“malloc.h“
//#include?“stdbool.h“
#define?n?204
int?count;
//int?m=0;
//int?circuit[m];
int?g[n+1][n+1];//用來存儲(chǔ)節(jié)點(diǎn)之間關(guān)系的矩陣
int?edgecount[n+1];//存儲(chǔ)每個(gè)節(jié)點(diǎn)的度數(shù)
int?random()?//用來隨機(jī)節(jié)點(diǎn)之間關(guān)系?0表示不相連,1表示相連
{
int?k;
????
//????printf(“Ten?random?numbers?from?0?to?99nn\n“);
????k=rand()%2;
????return?k;
}
int?randomNode()//用來隨機(jī)節(jié)點(diǎn)
{
int?k;
????
//????printf(“Ten?random?numbers?from?0?to?99nn\n“);
????k=rand()%n+1;
????return?k;
}
void?adjacencyCount()//計(jì)算每一個(gè)節(jié)點(diǎn)鄰接邊的個(gè)數(shù)
{
int?ij;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
edgecount[i]+=g[i][j];
}
void?initGraph()//隨機(jī)生成一個(gè)連通圖,然后再生成歐拉圖
{
int?ij;
int?s;
for(
?屬性????????????大小?????日期????時(shí)間???名稱
-----------?---------??----------?-----??----
?????目錄???????????0??2010-10-15?14:14??歐拉圖問題\
?????文件????????6052??2010-10-12?17:21??歐拉圖問題\eular.cpp
?????文件????????3603??2010-10-12?15:06??歐拉圖問題\eular.cpp.bak
?????目錄???????????0??2010-10-14?16:47??歐拉圖問題\eulargraph\
?????目錄???????????0??2010-10-13?16:06??歐拉圖問題\eulargraph\Debug\
?????文件??????188516??2010-10-13?15:56??歐拉圖問題\eulargraph\Debug\eulargraph.exe
?????文件??????212000??2010-10-13?15:56??歐拉圖問題\eulargraph\Debug\eulargraph.ilk
?????文件???????14093??2010-10-13?15:56??歐拉圖問題\eulargraph\Debug\eulargraph.obj
?????文件??????203788??2010-10-09?15:23??歐拉圖問題\eulargraph\Debug\eulargraph.pch
?????文件??????476160??2010-10-13?15:56??歐拉圖問題\eulargraph\Debug\eulargraph.pdb
?????文件????????2311??2010-10-09?15:23??歐拉圖問題\eulargraph\Debug\StdAfx.obj
?????文件???????41984??2010-10-13?15:56??歐拉圖問題\eulargraph\Debug\vc60.idb
?????文件???????53248??2010-10-13?15:56??歐拉圖問題\eulargraph\Debug\vc60.pdb
?????文件????????6939??2010-10-13?15:56??歐拉圖問題\eulargraph\eulargraph.cpp
?????文件????????4584??2010-10-09?14:27??歐拉圖問題\eulargraph\eulargraph.dsp
?????文件?????????528??2010-10-09?14:27??歐拉圖問題\eulargraph\eulargraph.dsw
?????文件???????50176??2010-10-14?16:47??歐拉圖問題\eulargraph\eulargraph.ncb
?????文件???????48640??2010-10-14?16:47??歐拉圖問題\eulargraph\eulargraph.opt
?????文件????????1778??2010-10-13?15:56??歐拉圖問題\eulargraph\eulargraph.plg
?????文件????????1232??2010-10-09?14:27??歐拉圖問題\eulargraph\ReadMe.txt
?????文件?????????297??2010-10-09?14:27??歐拉圖問題\eulargraph\StdAfx.cpp
?????文件?????????769??2010-10-09?14:27??歐拉圖問題\eulargraph\StdAfx.h
?????文件???????23552??2010-10-09?10:48??歐拉圖問題\歐拉回路.doc
?????文件???????27136??2010-10-09?11:02??歐拉圖問題\歐拉回路C++.doc
?????文件???????61952??2010-10-09?11:00??歐拉圖問題\隨機(jī)建立歐拉圖.doc
評(píng)論
共有 條評(píng)論