图论-欧拉
文章平均质量分 86
STILLxjy
不要让任何人打乱你生活的节奏
展开
-
(CF 788) B. Weird journey 欧拉通路 + dfs判断图的连通性
题目链接:http://codeforces.com/problemset/problem/788/BB. Weird journey time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard output Little boy Igor wants原创 2017-04-05 09:55:03 · 495 阅读 · 0 评论 -
(POJ 1041)John's trip [无向欧拉图] 输出字典序最小的欧拉回路
John’s trip Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 9278 Accepted: 3112 Special Judge DescriptionLittle Johnny has got a new car. He decided to drive around the town原创 2017-10-09 11:30:09 · 791 阅读 · 0 评论 -
(POj 2230)Watchcow [有向欧拉图] 输出欧拉回路
Watchcow Time Limit: 3000MS Memory Limit: 65536K Total Submissions: 8436 Accepted: 3670 Special Judge DescriptionBessie’s been appointed the new watch-cow for the farm. Every night, it原创 2017-10-08 15:51:58 · 582 阅读 · 0 评论 -
[欧拉图总结]
http://www.cnblogs.com/pandy/archive/2009/05/07/1452209.htmlhttp://bchine.com/mjmjmtl/?p=241参考以上:判断欧拉路,欧拉回路:注意图联通,可以DFS或者并查集一.无向图欧拉回路:每个顶点度数都是偶数欧拉路:所有点度数为偶数,或者只有2个点度数为奇数二.有向图(非混合)欧拉回路:每个顶点入度等于出度欧拉路:每个顶转载 2017-10-09 21:10:36 · 837 阅读 · 0 评论