Lets say I have a weighted tree (with positive, zero and negative weights for each node). How could I best find the subtree having the maximum weight? --~--~---------~--~----~------------~-------~--~----~ 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 [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
- [algogeeks] Finding the subtree with the largest weight Debajit Adhikary
- [algogeeks] Re: Finding the subtree with the largest... Yingjie Xu
- [algogeeks] Re: Finding the subtree with the lar... Debajit Adhikary
- [algogeeks] Re: Finding the subtree with the... LazyBoy
- [algogeeks] Re: Finding the subtree with the... Nima Aghdaie
- [algogeeks] Re: Finding the subtree with... Debajit Adhikary
- [algogeeks] Re: Finding the subtree... Nima Aghdaie
- [algogeeks] Re: Finding the subtree with... hc busy
- [algogeeks] Re: Finding the subtree with... hc busy
- [algogeeks] Re: Finding the subtree with the largest... dor