![](https://img-blog.csdnimg.cn/20201014180756928.png?x-oss-process=image/resize,m_fixed,h_224,w_224)
图论——欧拉图
图论——欧拉图
pxlsdz
冲就完了!
展开
-
欧拉图详解 (递归和非递归)(重新更改)
定义:欧拉回路:每条边只经过一次,而且回到起点欧拉图:具有欧拉回路的图欧拉路径:每条边只经过一次,不要求回到起点半欧拉图:具有欧拉通路而无欧拉回路的图判定:欧拉回路的判定无向图:连通(不考虑度为 0 的点),每个顶点度数都为偶数。有向图:基图连通(把边当成无向边,同样不考虑度为 0 的点),每个顶点出度等于入度。混合图(有无向边和有向边):首先是基图连通(不考虑...原创 2018-12-13 00:53:45 · 1325 阅读 · 2 评论 -
POJ 2513 Colored Sticks(欧拉回路判断+字典树Trie+并查集)
Colored Sticks Time Limit: 5000MS Memory Limit: 128000K Total Submissions: 40272 Accepted: 10463 Description You are given a bunch of wooden sticks. E...原创 2019-02-23 22:19:21 · 245 阅读 · 0 评论 -
POJ 1300 Door Man (无向图欧拉通路和回路的判定+并查集)
Door Man Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 3284 Accepted: 1368 Descriptio...原创 2018-12-19 01:01:47 · 291 阅读 · 0 评论 -
POJ 1386 Play on Words (判定有向图图欧拉路径是否存在)
Play on Words Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 15130 Accepted: 4856 Description Some of the secret doors contain a very inte...原创 2018-12-17 23:55:28 · 327 阅读 · 0 评论 -
POJ 2337 Catenyms(有向欧拉图:输出字典序最小欧拉路径)
Catenyms Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 13493 Accepted: 3517 DescriptionA catenym is a pair of words separated by a p...原创 2018-12-17 00:39:58 · 552 阅读 · 0 评论 -
POJ 1041John's trip (无向图欧拉回路-路径输出)
John's trip Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 10564 Accepted: 3617 Special Judge DescriptionLittle Johnn...原创 2018-12-15 17:39:08 · 426 阅读 · 0 评论 -
HDU 1878 欧拉回路(并查集:简单欧拉回路判定)
欧拉回路 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 18877 Accepted Submission(s): 7350 Problem Description 欧拉回路是指不令笔离...原创 2018-12-14 00:05:12 · 295 阅读 · 0 评论 -
HDU 3018 Ant Trip(并查集:无向图欧拉回路的问题)
Ant TripTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4709 Accepted Submission(s): 1847 Problem DescriptionAnt Country consist of N...原创 2018-12-13 23:58:33 · 273 阅读 · 0 评论 -
一笔画问题
【例题】一笔画问题时间限制: 1000 ms 内存限制: 65536 KB提交数: 676 通过数: 216 【题目描述】如果一个图存在一笔画,则一笔画的路径叫做欧拉路,如果最后又回到起点,那这个路径叫做欧拉回路。根据一笔画的两个定理,如果寻找欧拉回路,对任意一个点执行深度优先遍历;找欧拉路,则对一个奇点执行dfs,时间复杂度为O(m+n),m为边数,n...原创 2018-04-19 18:59:20 · 1456 阅读 · 0 评论 -
POJ - 2230 欧拉回路的输出
Bessie's been appointed the new watch-cow for the farm. Every night, it's her job to walk across the farm and make sure that no evildoers are doing any evil. She begins at the barn, makes her patrol, ...原创 2019-06-08 13:04:18 · 178 阅读 · 0 评论