Re: Finding the subtree with the largest weight

From: "Malcolm McLean" <regniztar@xxxxxxxxxxxxxx>
Date: Tue, 29 Jan 2008 10:12:15 -0000

"Debajit Adhikary" <debajit1@xxxxxxxxx> wrote in message

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?

As the problem is specified, I don't think there is an easy answer except to recursively examine every node, and keep a list of weights. Then take the highest.

--
Free games and programming goodies.
http://www.personal.leeds.ac.uk/~bgy1mm

.

References:
- Finding the subtree with the largest weight
  - From: Debajit Adhikary

Prev by Date: Re: Between C and Java - which is easier for writing networking software
Next by Date: Re: crossword project works
Previous by thread: Finding the subtree with the largest weight
Index(es):
- Date
- Thread