you could have given the actually link to this problem, anyway just a dfs will determine if it a tree or not.
On Tue, Aug 9, 2011 at 1:28 AM, Anil Arya <[email protected]> wrote: > 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*). > > > -- > Anil Kumar Arya > B.Tech III year > computer science & engineering > M.N.N.I.T Allahabad. > > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to [email protected]. > To unsubscribe from this group, send email to > [email protected]. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
