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
ram:
20150902 08:35:16
Easy ques :)


tonystark1996:
20150831 15:32:46
Weak Test Cases


coder_shishir:
20150822 23:09:42
awesome problem ..learned a lot !!! 

Vivek:
20150818 10:56:19
if Using DFS, Don't use ADJ Matrix.It would result in O(v^2) time.


SangKuan:
20150812 05:24:18
first i used visited array and got many errors,then is use two hash, colored and merge the edge got ac.no need


nadavishe:
20150810 15:48:19
Very week test cases 

Saksham :
20150804 01:50:59
no need of graph 

harkirat:
20150728 13:52:53
how weak are the test cases?


Anurag Pasi:
20150705 18:13:25
@Tanmay Kulshrestha I partially agree with u, when m==n1 and still not a tree i.e it is cyclic , but i dont think there will b a totally disconnected node mayb there or mayb not u cant say..


Tanmay Kulshrestha:
20150703 14:37:39
A confusion:

Added by:  ThanhVy Hua 
Date:  20070328 
Time limit:  0.166s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ERL JS 
Resource:  Coauthor Amber 