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
yasser1110:
20210219 14:54:05
+1 @jrseinc disjoint union set solution is the most straightforward one. Even though adjacency matrix and adjacency list solutions also work. Last edit: 20210219 14:54:25 

kelmi:
20210119 13:43:46
Try graphs like this one:


kelmi:
20210119 11:42:16
Keep the following edge cases in mind:


kushgupta_19:
20201016 19:55:17
For tree:


ican_code:
20201002 13:48:36
just make sure to type YES and not Yes . i hate it


sarkybastard:
20200924 23:29:07
AND WHAT IF I DONT? YOUR PROBLEMS ARE NOT MY PROBLEMS. 

kapilsukrit2:
20200922 05:04:52
GUYS LISTEN! FOR TLE > USE ADJACENCY LIST NOT MATRIX. SIMPLE DFS WORKS AS A CHARM!! 

samiya_ahmed5:
20200918 06:38:23
simple observation may help : 1 connected component and no cycle..:) 

singhar:
20200905 11:31:00
i submitted two solutions 1st for directed and second for undirected.Both got accepted.


jrseinc:
20200819 10:37:15
easy disjoint set union problem 
Added by:  ThanhVy Hua 
Date:  20070328 
Time limit:  0.5s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ERL JSRHINO 
Resource:  Coauthor Amber 