Any idea how to solve this problem? I am currently using graph and counting adjacent edges for the index. 1 ----> 2 \ \ 3 eg for this graph structure 2 will have maximum possible friends.I am still sorting out the bugs in my code. Anybody has better solution?
-- Saurabh Singh B.Tech (Computer Science) MNNIT ALLAHABAD -- 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.
