PART 2 DAA Maximum Matching in Bipartite Graph

[@prabhu2kraj]

Neatly explained mam.
The answer to your question is
M={(1,6) (2,5) (3,4) }

[@Anime_Kenji]

I🥰 like your voice

[@sahithivadlamani2574]

This is really helpful. I have been searching for this topic and views many vedios. But urs is the best!! Plz do cover more topics.

[@karthikburugula2572]

Can we also have {(A,2),(B,1),(C,3),(D,4),(E,5)} as an answer madam

[@sonamkamboj6074]

easily gathered nd nicely explained thank you mam

[@ritikarath6776]

Perfectly explained..tqsm mam..i clearly understood it ❤️✨

[@pankaj_kumar1991]

M = {(1,6),(2,5),(3,4)}. ????

[@xiali8007]

very enlightening, thank you so much.

[@MainulHasan1995]

Thank You so much.

[@saksshi]

nice explanation

[@daisymerina1496]

Mam crystal clear explanation... I have doubt in ford fulkerson Algorithm... Shall we reverse the direction in graph ???

[@vaishaliwadhwa8742]

Very nice

[@gopalagrawal8378]

thanks alot mam

[@lakshsinghania]

M={(3,4),(1,6),(2,5)}

[@eneshkaneshk380]

Got easily

[@AdduKeShorts]

Your camera is shaking in the whole video 😂

[@thakursanjaysingh1482]

M = {(1,6)(2,5)(3,4)}

[@sai-yl2ux]

M={(1,6),(2,5),(3,4)}