Lifts
Lifts

Lifts

Broing
Broing

Broing

Candies
Candies

Candies

Losing Weight
Losing Weight

Losing Weight

Wheelchair
Wheelchair

Wheelchair

Learning
Learning

Learning

Weight
Weight

Weight

Sarcasmism
Sarcasmism

Sarcasmism

New Years
New Years

New Years

New Year Resolution
New Year Resolution

New Year Resolution

🔥 | Latest

weights: How to be popular in 2020: “I have free weights at home.” Gymaholic App: https://www.gymaholic.co #fitness #motivation #workout #meme #gymaholic
 weights: How to be popular in 2020: “I have free weights at home.”  Gymaholic App: https://www.gymaholic.co  #fitness #motivation #workout #meme #gymaholic

How to be popular in 2020: “I have free weights at home.” Gymaholic App: https://www.gymaholic.co #fitness #motivation #workout #meme #...

weights: I need to do some cardio. Putting weights away is cardio. Gymaholic App: https://www.gymaholic.co #fitness #motivation #meme #workout #gymaholic
 weights: I need to do some cardio. Putting weights away is cardio.  Gymaholic App: https://www.gymaholic.co  #fitness #motivation #meme #workout #gymaholic

I need to do some cardio. Putting weights away is cardio. Gymaholic App: https://www.gymaholic.co #fitness #motivation #meme #workout #...

weights: 11:50 Add Question Q Quora Notifs Home Open Qs More FRitam Chatterjee upvoted this 19 Nov I like girl A. We are very good friends. A's best friend B likes me. Also, A likes a guy C who is my best bro and C likes another girl D who is in a relationship with another guy. What should we do? Priyanka Dhaka 10.7k upvotes by Ritam Chatterjee, Mukesh Sharma, (more) You can apply Bipartite Matching algorithm of Graph Theory. All you have to do is: 1. Put all girls as vertices (a's) in Part A, and boys as vertices (b's) in Part B. 2. Draw an edge between vertex a to vertex b if a likes b. 3. It will be a bipartite graph (there are no edges within vertices of Part A, and same for Part B) unless your friends are not straight. 4. Then find maximum matching for this bipartite graph. (refer this link Maximum Bipartite Matching-GeeksforGeeks) 5. You will get maximum matching as output and the matched edges will be the pairs who should be together. 6. You can apply weighted bipartite matching algorithm if you know how much they love/like each other. In that case, assign weights according to their amount of love. and repeat step 4 and 5. Thanks for asking this question. Finally I have found a real life problem which can be solved by what Prof Panda has been teaching us for 2-3 years. P.S.I can provide you code for both weighted and unweighted maximum bipartite matching which I made for my project. Updated 28 Jul. Graph Theory can Save Relationships
 weights: 11:50
 Add Question Q
 Quora
 Notifs
 Home
 Open Qs
 More
 FRitam Chatterjee upvoted this 19 Nov
 I like girl A. We are very good friends. A's best friend B
 likes me. Also, A likes a guy C who is my best bro and
 C likes another girl D who is in a relationship with
 another guy. What should we do?
 Priyanka Dhaka
 10.7k upvotes by Ritam Chatterjee, Mukesh Sharma, (more)
 You can apply Bipartite Matching algorithm of Graph Theory.
 All you have to do is:
 1. Put all girls as vertices (a's) in Part A, and boys as vertices
 (b's) in Part B.
 2. Draw an edge between vertex a to vertex b if a likes b.
 3. It will be a bipartite graph (there are no edges within
 vertices of Part A, and same for Part B) unless your friends
 are not straight.
 4. Then find maximum matching for this bipartite graph. (refer
 this link Maximum Bipartite Matching-GeeksforGeeks)
 5. You will get maximum matching as output and the matched
 edges will be the pairs who should be together.
 6. You can apply weighted bipartite matching algorithm if you
 know how much they love/like each other. In that case,
 assign weights according to their amount of love. and repeat
 step 4 and 5.
 Thanks for asking this question. Finally I have found a real life
 problem which can be solved by what Prof Panda has been
 teaching us for 2-3 years.
 P.S.I can provide you code for both weighted and unweighted
 maximum bipartite matching which I made for my project.
 Updated 28 Jul.
Graph Theory can Save Relationships

Graph Theory can Save Relationships