Hello !!!
Give an algorithm for finding the maximum match in general weighted
graphs, using max incremental weight property. I think we have to
first find out all the augmenting paths and then select the one having
maximum incremental weight and proceed. But how to find all the
augmenting
Hello !!!
Give an algorithm for finding the maximum match in general weighted
graphs, using max incremental weight property. I think we have to
first find out all the augmenting paths and then select the one having
maximum incremental weight and proceed. But how to find all the
augmenting
Dor,
If I understand the problem correctly, we don't know what are all the
elements in S (that's what we need to find).
So how are you going to pick 'k' first and how do you know of 'x'
belonging to S?
--~--~-~--~~~---~--~~
You received this message because you
Following is the Solution for sum of subsets with complexity O(n).
suppose we have to find out the 2 numbers from array(Set) whose sum is
equivalent to certain no: k
int main(){
int a[10]={1,2,3,4,5,6,7,8,9,10};
int sum =15; //no. to find for
int i=0,j;
front=i;
back=10
while(frontback){
Hi
Try to Elaborate the Explanation ..plss
--~--~-~--~~~---~--~~
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,
On Apr 2, 2:12 am, ipsita [EMAIL PROTECTED] wrote:
Hello !!!
Give an algorithm for finding the maximum match in general weighted
graphs, using max incremental weight property. I think we have to
first find out all the augmenting paths and then select the one having
maximum incremental
Sorry for the late reply. I was out for some days.
First thanks to those friends who mention the soundex. Since this is a
data structure question, I think just saying using soundex is not the
proper answer. :-) Also, to my understanding, soundex is good for
exact match, not approximate match
