HDU 1325 Is It A Tree? ( 有向图判断环
来源:互联网 发布:淘宝缩水女是谁 编辑:程序博客网 时间:2024/06/05 11:31
Is It A Tree?
Description
A tree is a well-known data structure that is either empty (null, void, nothing) or is a set of one or more nodes connected by directed edges between nodes satisfying the following properties.
There is exactly one node, called the root, to which no directed edges point.
Every node except the root has exactly one edge pointing to it.
There is a unique sequence of directed edges from the root to each node.
For example, consider the illustrations below, in which nodes are represented by circles and edges are represented by lines with arrowheads. The first two of these are trees, but the last is not.
In this problem you will be given several descriptions of collections of nodes connected by directed edges. For each of these you are to determine if the collection satisfies the definition of a tree or not.
Input
The input will consist of a sequence of descriptions (test cases) followed by a pair of negative integers. Each test case will consist of a sequence of edge descriptions followed by a pair of zeroes Each edge description will consist of a pair of integers; the first integer identifies the node from which the edge begins, and the second integer identifies the node to which the edge is directed. Node numbers will always be greater than zero.
Output
For each test case display the line Case k is a tree." or the line
Case k is not a tree.”, where k corresponds to the test case number (they are sequentially numbered starting with 1).
Sample Input
6 8 5 3 5 2 6 45 6 0 08 1 7 3 6 2 8 9 7 57 4 7 8 7 6 0 03 8 6 8 6 45 3 5 6 5 2 0 0-1 -1
Sample Output
Case 1 is a tree.Case 2 is a tree.Case 3 is not a tree.
题意
有向图判断是否有环
题解:
有向图 度数大于等于2肯定存在环路
AC代码
#include <bits/stdc++.h>using namespace std;const int maxn = 10010;bool vis[maxn];int indeg[maxn];int main(){ int cas = 0; int a, b; while(scanf("%d%d", &a, &b),a>=0||b>=0) { if(a==0 && b==0) { printf("Case %d is a tree.\n", ++cas); continue; } int maxx = 0; if(a > maxx) maxx = a; if(b > maxx) maxx = b; memset(vis, false, sizeof(vis)); memset(indeg, 0, sizeof(indeg)); vis[a] = vis[b] = true; indeg[b]++; while(scanf("%d%d", &a, &b), a!=0||b!=0) { if(a > maxx) maxx = a; if(b > maxx) maxx = b; indeg[b]++; vis[a] = vis[b] = true; } bool flag = true; int k = 0; for(int i = 1; i <= maxx; i++) if(vis[i] && indeg[i] > 1) { flag = false; break; } for(int i = 1; i <= maxx; i++) if(vis[i] && indeg[i] == 0) k++; if(!flag || k != 1) printf("Case %d is not a tree.\n", ++cas); else printf("Case %d is a tree.\n", ++cas); } return 0;}
- HDU 1325 Is It A Tree? ( 有向图判断环
- HDU:1325 Is It A Tree?(并查集+有向图树的判断)
- hdu 1325 Is It A Tree?(利用入度判断有向树)
- HDU 1325 Is It A Tree?(并查集/有向树的判断)
- POJ 1308 hdu 1325 Is It A Tree?【并查集+入度 判断一个有向图是树】
- 杭电-1325 Is It A Tree?(有向图回路)
- POJ——1308Is It A Tree?(模拟拓扑排序判断有向图是否为树)
- poj 1308 Is It A Tree? 并查集,有向树的判断
- [POJ 1308]Is It A Tree?[并查集][判断有向树]
- HDU 1325 Is It a Tree?
- hdu 1325 Is It A Tree?
- hdu 1325 Is It A Tree?
- hdu 1325 Is It A Tree?
- hdu 1325 Is It A Tree?
- hdu 1325 Is It A Tree?
- hdu 1325 is it a tree?
- HDU-1325-Is It A Tree?
- HDU 1325 Is It A Tree? ---树
- Hadoop(六)--->核心设计
- spring cloud config
- 利用Python进行数据分析(1)—— Numpy Basic(1)
- java中的方法参数传递机制---值传递
- php文件锁的使用
- HDU 1325 Is It A Tree? ( 有向图判断环
- HDU1005(2)
- Hibernate批量抓取
- ITIL 2011 服务管理与认证读书笔记——第五章 服务转换
- Hadoop(七)---MapReduce计算模型
- (7)2017.8.7-面向对象(2)
- curl
- Kotlin:基本类型都是对象,原生类型将成为回忆
- 从外网访问内网服务器的方法