[algogeeks] I'm stuck with this problem

Suppose that I have some data: 12,30 12,45 2,3 7,8 3,9 30, 8 45,54 56,65 Where (a,b) indicates that a is connected to b. I want to get all connected nodes to one point. For instance, the output of the above example should be something like: Group 1 2,3 3,9 Group 2 12,30 12,45 30,8 7,8 Group 3 4

[algogeeks] Re: subset with maximum sum.

read Kadane's Algo. On 10/13/07, kannan <[EMAIL PROTECTED]> wrote: > > > hellow! > here is the problem statement. > you have to find the subset having the maximum sum in the given array > of +ve and -ve numbers. > try not to foll

[algogeeks] subset with maximum sum.

hellow! here is the problem statement. you have to find the subset having the maximum sum in the given array of +ve and -ve numbers. try not to follow brute force method. --~--~-~--~~~---~--~~ You received this message because you are subscribed to the Go