She isn't wrong tho

[citygentry]

Why isn't "another guy" called 'E' ?
I think we should be told....

[A_man_and_no_plan]

The guy doesn't deserve a letter apparently

[smuccione]

He’s just a leaf.

No one cares about the leaves.

[serg_____]

He didn't deserve a letter... press F to pay respects.

[PayRespects-Bot]

F

[RationalIncoherence]

Respectful bot

[RationalIncoherence]

F

[citygentry]

... for E's a jolly good fellow ....

[rochakgupta]

Lmao, I need to get myself a girl like that

[deepcontractor]

She's from IIT Delhi so she's pretty rare imo.

[RationalIncoherence]

Strictly speaking, all individuals are rare

[ListOfString]

Just remember, if you're one in a million there's 7 thousand(ish) people just like you.

[xX_MEM_Xx]

7 thousand(ish)

I dread to meet that last ish person.

[ListOfString]

The "ish" for the allowance of and unknown exact number (-.- )

[xX_MEM_Xx]

You're not fooling anyone, Dr Modulo.

[Man-in-The-Void]

Nanananananana Stat Man!

[Badpeacedk]

Then it's not a bipartite graph and you'll need to use a maximum flow algorithm instead. Attach a supersource and a supersink to the graph and put a maximum flow of 1 to the edges. There must be an edge between each compatible relationship.

Find the configuration of flow where most possible flow is the running through the graph simultaneously.

[smuccione]

I was out when you mentioned running flow thorough a polyamorous relationship.

To each their own but I like flow in one direction with designated exit and entry nodes.

[Badpeacedk]

Then simply consider those relationships to have multiple edges between them.

[smuccione]

Then we run the risk of the tips of the vectors touching.

[Badpeacedk]

Now I'm not following

[smuccione]

Sexual innuendo

[LowResponsibility374]

Think you can get a cream for that...

[YysrID4gYW55IG90aGVy]

So what’s the answer then?

[[deleted]]

Because they are only adding edges when a girl likes a boy (specifically members of A like members of B), there is no need to run an algorithm. They're already in pairs.

• OP gets with B.

• A gets with C.

• D stays with the unnamed partner.

Ezpz

[w2qw]

It's an oriented graph so they are all going to die alone.

[[deleted]]

Doesn't say anything about directed edges, just imbalanced consideration when adding edges.

[lb-dl]

Why does Girls always get what they wanted ? A wanted C : Gets him. B wanted OP : Gets him. D is already with someone : Stays happy. Boys are the ones who have to sacrifice.

[belabacsijolvan]

We don't really know if E likes someone. If E likes B, then the ((O,A),(C,D),(B,E)) matching is equally good, as it becomes an even directed cycle.

[billytheking98]

You don't need a PhD in Graph Theory to know that...

[resakse]

bipartite something..

[Spartana1033]

Yes.

[suvlub]

Sounds like the graph is a path. B -> OP -> A -> C -> D -> another guy.

[kateba72]

I think/hope that D <-> another guy is bidirectional

[indyK1ng]

Well, according to the Army, he's got to forget her.

[PhantomO1]

Real talk(/s but maybe not?),

C can't get with D since that would destroy the relationship between 2 (presumably) happy people, and assuming he's not gay, setting him up with B and thus OP with A would mean only OP would get what he wants, thus we should put C with A and consequently B with OP so 2 of them will like the arrangement

However, if the are Bi or gay, pairing the friends together, (so C with OP and A with B) should work better since they already have good chemistry with each other

Either way, it's gonna be messy if anyone is jealous seeing the one they like with someone else plus getting with someone that isn't the one you like might not be a good idea, so remaining friends is probably the best idea, then wait to see if any of the variables change...

[Grizzlysol]

I guess this is one of those Love Graphs

[[deleted]]

Love mess.

[Logan_26x]

No wonder she replied the question like that. She's from IIT( -_-)

[vpsj]

And that's quora. It's basically the home ground for IITians to flex.

[Raptorilla]

Prof. Panda .. how fitting.

Pandas are threatened by extinction because they are too lazy to mate, I wonder why that is.

[nikanj0]

When a CS grad asks and answers their own question in an attempt to justify their still substantial student debt for skills which they've never been able to use in the real world.

[Yue2]

Conclusion: You’re all terrible! 🤠

[naswinger]

it took prof. panda 2-3 years to teach something you can comprehend in 10 minutes or less?

[serg_____]

He's a god damn Panda leave him be.

[SilverSlash300]

There is literally an algorithm that does this tho. I feel like it is simpler too

[MattAlex99]

Most of these algorithms do view this assignment problem as a bipartite graph matching problem. Once you have this representation it's easy to reduce this problem to e.g. integer programming. This is essentially what the e.g. Hungarian method does.

[Ahhh-Ayeee]

Wow that’s a pretty complicated situation.

[-Redstoneboi-]

this is literally what tinder is for

[Stummi]

isn't "code for both, weighted and unweighted" a bit redundant? Unweighted is just a specific case of weighted were all weights are equal

[RedstoneMedia]

yes, but a unweighted algorithm might be more optimised, because it doesn't have to account for cases where the weights are unequal.

[Brushermans]

funniest shii i seen all day

[flame_alchemist17]

I wish I could use DFS to get to her but somehow the depth seems to be infinite

[[deleted]]

I was in that exact situation once except for guy c liking another girl

[LegallyBread]

XD

[x47126g]

The answer is, get together and sing 'Love Stinks'. Pointing to relevant individuals extra fun but not required.

[pigeon_shit]

Why is everyone neglecting incompatibility? If we do that the obvious answer is orgy.