question already in discussion....check thread started by navin [directi question]
no more discussion here. ---------------------------------------------Thread Closed-------------------------------------------------- -- Amol Sharma Third Year Student Computer Science and Engineering MNNIT Allahabad <http://gplus.to/amolsharma99> <http://twitter.com/amolsharma99><http://in.linkedin.com/pub/amol-sharma/21/79b/507><http://www.simplyamol.blogspot.com/> On Sun, Mar 25, 2012 at 4:23 PM, Algo-Geek <navin.nit...@gmail.com> wrote: > In the below example , two most distant nodes are ( h,k) or ( h,j ) > - a- > -b- - c- > d - e- j k > - f - g > h > So we have to find two nodes between whom , the distance is maximised. > This boils down to finding the two nodes in the diameter of the tree. as > the diameter is the longest path between two nodes in tree. > How to do this.This is not just finding the diameter length.but the two > nodes in the diameter > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To view this discussion on the web visit > https://groups.google.com/d/msg/algogeeks/-/JVD4-Y1eZ14J. > To post to this group, send email to algogeeks@googlegroups.com. > To unsubscribe from this group, send email to > algogeeks+unsubscr...@googlegroups.com. > 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 algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
