PT07Y - Is it a tree
You are given an unweighted, undirected graph. Write a program to check if it's a tree topology.
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).
Print YES if the given graph is a tree, otherwise print NO.
Input: 3 2 1 2 2 3 Output: YES
|Added by:||Thanh-Vy Hua|
|Cluster:||Cube (Intel Pentium G860 3GHz)|
|Languages:||All except: ERL JS SCM chicken|
@krishan kumar, the ans should also be NO
recommended for graph beginners
easy stl set ;)Last edit: 2015-01-11 19:09:17
Last edit: 2015-01-08 23:26:48
simple DFS :)
A basic implementation of union find algorithm works, so agreed, hussein. AC!
BFS using adjacency matrix: 0.16s,385M
A simple loop with parents array is enough .. no need for DFS or BFS or any graph traversal algo