Re: [algogeeks] NUMBER OF MST ?
Shouldnt it be (n!)/2 ? Equivalent to permutation of n distinct numbers except that we need to count each permutation once, since for any permutation, there would also be a reverse permutation that would result in an identical mst in the given scenario. -- Dipit Grover B.Tech in Computer Science and Engineering - lllrd year IIT Roorkee, India -- 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.
Re: [algogeeks] NUMBER OF MST ?
^ we need to count each permutation and its reverse together as one possibility since both would result in identical mst. -- Dipit Grover B.Tech in Computer Science and Engineering - lllrd year IIT Roorkee, India -- 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.
Re: [algogeeks] NUMBER OF MST ?
N!/2 On 03-Dec-2011 11:30 PM, Dipit Grover dipitgro...@gmail.com wrote: ^ we need to count each permutation and its reverse together as one possibility since both would result in identical mst. -- Dipit Grover B.Tech in Computer Science and Engineering - lllrd year IIT Roorkee, India -- 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. -- 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.
Re: [algogeeks] NUMBER OF MST ?
On Sun, Dec 4, 2011 at 12:10 AM, praveen raj praveen0...@gmail.com wrote: N!/2 N!/2 is definitely wrong as you guys are thinking of MST with just two terminal nodes. All the MSTs will be much more than N!/2 because of any number of terminal nodes possible, but i can't find the closed form it. On 03-Dec-2011 11:30 PM, Dipit Grover dipitgro...@gmail.com wrote: ^ we need to count each permutation and its reverse together as one possibility since both would result in identical mst. Aamir Khan | 3rd Year | Computer Science Engineering | IIT Roorkee -- 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.
Re: [algogeeks] NUMBER OF MST ?
Mistake noted! Haste makes waste indeed. -- 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.
Re: [algogeeks] NUMBER OF MST ?
http://en.wikipedia.org/wiki/Cayley%27s_formula -- 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.
