PT07Y - Is it a tree
You are given an unweighted, undirected graph. Write a program to check if it's a tree topology.
Input
The first line of the input file contains two integers N and M --- number of nodes and number of edges in the graph (0 < N <= 10000, 0 <= M <= 20000). Next M lines contain M edges of that graph --- Each line contains a pair (u, v) means there is an edge between node u and node v (1 <= u,v <= N).
Output
Print YES if the given graph is a tree, otherwise print NO.
Example
Input: 3 2 1 2 2 3 Output: YES
hide comments
|
sam96:
2016-06-10 18:18:03
HINT : A graph is a cycle if it no. of connected components=1 and edges = nodes-1
|
|
and_roid:
2016-06-08 09:33:08
My first in graph theory!!..AC in one go!!
|
|
weramajstor:
2016-05-27 19:46:40
I have the right to vote finally vuhuuuuu! |
|
Mihir Saxena:
2016-05-19 19:24:16
Getting sigsegv error, what can be the possibility?
|
|
Luis Herrera:
2016-05-13 22:20:50
Interesting problem.
|
|
anupamwadhwa:
2016-05-12 20:38:21
if any node is not connected to rest of nodes then it should YES or NO |
|
dinkar:
2016-05-01 10:23:14
Nice problem, got to learn about union find. |
|
lisbecg:
2016-04-15 03:22:32
Did you guys build the graph in order to do DFS? |
|
sharif ullah:
2016-03-12 12:31:25
just use union find check if there is a loop! |
|
vimal:
2016-03-06 17:12:11
accepted on codechef... WA here... :D
|
| Added by: | Thanh-Vy Hua |
| Date: | 2007-03-28 |
| Time limit: | 0.5s |
| Source limit: | 50000B |
| Memory limit: | 1536MB |
| Cluster: | Cube (Intel G860) |
| Languages: | All except: ERL JS-RHINO |
| Resource: | Co-author Amber |
RSS