Bipartite Matching | Elementary Math problem | Network Flow | Graph Theory

แชร์
ฝัง
  • เผยแพร่เมื่อ 18 ธ.ค. 2024

ความคิดเห็น • 21

  • @pushkar260
    @pushkar260 6 ปีที่แล้ว +21

    the way the problem was seen as a graph in particular a bipartite graph, the creation of the graph, right down to the end solution was just plain AWESOME

  • @dialga2
    @dialga2 6 ปีที่แล้ว +6

    I just started watching this channel to prepare for interviews and I'm already in love with the crisp animations and presentation. Thanks for your work William! So weird to think of how we both work in MV! Small world!

  • @muhammadbilalshahid8010
    @muhammadbilalshahid8010 2 ปีที่แล้ว

    Very lucid explanation with an excellent example!

  • @DelaraJalali
    @DelaraJalali 7 หลายเดือนก่อน

    Thank you so much for your excellent explanation.

  • @forcedlevy
    @forcedlevy 4 ปีที่แล้ว +1

    Dear diary, I learned something new today.

  • @shvmsxn41
    @shvmsxn41 4 ปีที่แล้ว +2

    This is pure gold.

    • @ishanpandey2949
      @ishanpandey2949 4 ปีที่แล้ว

      Indeed, a month later, i've started too ...

  • @ashwiniai7521
    @ashwiniai7521 3 ปีที่แล้ว +1

    Hi, shouldn't all n solutions be different? Why are we allowing 6 (for eg.) to be final solution of so many pairs?

  • @tianbinjiang3018
    @tianbinjiang3018 6 ปีที่แล้ว +1

    Can you post Binary Segment Tree explain and Do a compare with Binary Index tree?

  • @putnam120
    @putnam120 ปีที่แล้ว

    For repeated pairs could you do one of the following?
    1) set the capacity from s to (a,b) to the number of instances of the pair.
    2) instead of having nodes labed by pair (a,b) label them as (a,b,c). Where c ranges from 1 - N, and N is the number of times the pair is repeated.

    • @portobellomushroom5764
      @portobellomushroom5764 หลายเดือนก่อน

      You're on the right track for option 1. He even hints at this around 8:05

  • @DelaraJalali
    @DelaraJalali 7 หลายเดือนก่อน

    you are amazing, thank you so much

  • @rob6129
    @rob6129 4 ปีที่แล้ว

    For multiple pairs of the same numbers {a, b} the capacitiy for (s, {a,b}) can just be increased to the number of such pairs. The rest stays the same

    • @tilakmadichettitheappdeveloper
      @tilakmadichettitheappdeveloper 4 ปีที่แล้ว

      nope - that's not enough :)

    • @Tw33tMonsta14
      @Tw33tMonsta14 4 ปีที่แล้ว +1

      @@tilakmadichettitheappdeveloper would you also increase the capacities for the edges that are in between {a, b} and t?

    • @revanthkalavala1829
      @revanthkalavala1829 2 ปีที่แล้ว

      just taking eid is enough imo, no need to change any capacities and it should still work or am I missing something ?

  • @orbitmarketing-usa
    @orbitmarketing-usa 4 ปีที่แล้ว

    so helpful, thanks

  • @nadiapranabudi1749
    @nadiapranabudi1749 3 ปีที่แล้ว

    Thank you so much!

  • @kshitijsingh609
    @kshitijsingh609 3 ปีที่แล้ว

    Thank you🙏