欧拉::
关注
分享
扫一扫
文章平均质量分 55
阿阿阿黄
后续文章更新：https://segmentfault.com/u/aaahuang
展开
-
poj--1300
Door ManTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 2530 Accepted: 1020DescriptionYou are a butler in a large mansion. This mansion has so many room原创 2015-12-10 21:21:29 · 313 阅读 · 0 评论 -
poj--1386
Play on WordsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 10995 Accepted: 3754DescriptionSome of the secret doors contain a very interesting word puz原创 2015-12-10 22:34:57 · 311 阅读 · 0 评论 -
欧拉回路或通路路径输出(Fleury算法)
在下面的代码中,首先判断是否存在回路或通路,如果存在则选择一个正确的顶点按照Fleury算法输出欧拉回路或通路代码如下:#include#include #define MAXN 200using namespace std;int Edge[MAXN][MAXN];//邻接矩阵int n;//顶点个数 struct stack{ int top,node[M原创 2015-12-14 20:49:01 · 1217 阅读 · 0 评论 -
hdu--3018
Ant TripTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2156 Accepted Submission(s): 831Problem DescriptionAnt Country consis原创 2015-12-16 13:05:04 · 450 阅读 · 0 评论 -
poj--1041
John's tripTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 8015 Accepted: 2694 Special JudgeDescriptionLittle Johnny has got a new car. He decided t原创 2015-12-16 20:44:55 · 322 阅读 · 0 评论 -
欧拉输出路径--dfs模板
下面是代码,它同时适用欧拉通路和欧拉回路.但如果需要打印的是欧拉通路,在主程序中调用的参数必须是道路的起点.另外,打印的顺序是逆序的,因此真正使用这份代码时,应该把printf语句替换成一条push语句，把（u，v）压入栈中。代码如下：void euler(int u){ for(int v=0;v<n;v++){ if(G[u][v]&&!vis[u][v]){ vi原创 2015-12-16 20:53:12 · 1157 阅读 · 0 评论 -
poj--2337(输出欧拉路径)
CatenymsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 10681 Accepted: 2788DescriptionA catenym is a pair of words separated by a period such that the原创 2015-12-14 20:15:24 · 563 阅读 · 0 评论