[Discrete Mathematics] Minimal Cuts

Поделиться
HTML-код
  • Опубликовано: 18 ноя 2024

Комментарии • 23

  • @chickenwaffle_
    @chickenwaffle_ 5 лет назад +9

    Finished Discrete Math 1 and 2, and I would like to say THANK YOU for helping me! Your videos are underrated, wish more people could check your videos.

    • @johnaiii1281
      @johnaiii1281 2 года назад

      Do you have access to DiscreteMath2 video number 37 and 38 by TrevTutor? Because it says on the youtube playlist there are 38 lecture videos on Discrete Math 2 by TrevTutor and 2 are unavailable, maybe it's blocks by my country or something like that.

  • @jolystuff
    @jolystuff 7 лет назад +4

    in the first 4 mins you just explained what took our lecturer half a semester... thank you!!

    • @motivees3934
      @motivees3934 4 года назад

      what university you were in brother

  • @AskJonJong
    @AskJonJong 6 лет назад +4

    actually went through whole course, awesome course great job and hope you continue. thanks for contributing more mathematics to humanity :)

  • @PatricioDan
    @PatricioDan 7 лет назад +14

    I'm sorry, I think when flows goes from 4 to sink max capacity must be 6/6, because you have 5 coming from 3 to 4 and 1 from 2 to 4. Then when you do the minimal cut, you just cut all edges exhausted and minimal cut equals max flow which is 13. But in the way you did it the flow equals 12, not 13

    • @HafidzJazuli
      @HafidzJazuli 7 лет назад

      I agree with you.
      Let f is flow, then: f(2, 5, s) + f(3, s) + f(4, s) = 4 + 3 + 6
      So, the only need to be fixed is the flow value of edge 4 -> s

    • @olatunjiobalowumohammed71
      @olatunjiobalowumohammed71 6 лет назад

      1 from node 2 to node 4 and 5 from node 3 to node 4, making 6 at node 4. 6+3+4=13. He actually forgot to mention the 1 coming from node 2 to node 4 but it has been considered. All the edges capacities are exhausted in the cut

  • @RinzlerStroger
    @RinzlerStroger 17 дней назад

    thank you so much for the both courses man, may Allah guide you

  • @darianharrison4836
    @darianharrison4836 7 лет назад +1

    Thank you for both the Discrete math 1 and 2 Courses, very helpful !!

  • @user-qf7ym5vc7o
    @user-qf7ym5vc7o 6 лет назад

    Many thanks to your Discrete Math 1 and 2, finally come to the end and i pretty sure to get the "maximum flow" in the upcoming exam

  • @MissHappyToast
    @MissHappyToast 8 лет назад +3

    Thank you! Very well explained

  • @hke4369
    @hke4369 3 года назад

    Very well explained.

  • @s.s.wanniarachchi8700
    @s.s.wanniarachchi8700 5 лет назад +1

    Very Useful Thank you

  • @changfuli
    @changfuli 3 года назад

    Hi Thanks for the excellent video, I have one question, why the capacity coming out of the source is 3+2 = 5, but the capacity into the sink is 5+7 = 12? Should them be equal? Many thanks!

  • @JJ-ey3dg
    @JJ-ey3dg 7 лет назад +1

    solid explanation.

  • @Ancientlaws
    @Ancientlaws 9 лет назад +6

    Thank you good sir

  • @natyarambhe7193
    @natyarambhe7193 7 лет назад +1

    thank you it is helpful!!

  • @xSolBadguy
    @xSolBadguy 3 года назад

    Man, I'm so confused as to what the second number after the first on the weighted edges refers to. What does the 5 mean in (6,5) for the final example, for instance?

    • @xSolBadguy
      @xSolBadguy 3 года назад

      Like, I think I see why it's (6,5), but why is it not (3,8) and (4,9)? Because they come from nodes that are the first child of the Source node.. I guess?

  • @harishkayarohanam4834
    @harishkayarohanam4834 7 лет назад

    How do you say 4-sink gets max of 5 out of 6. is it not 6 because 4 and 5 come in which sums to 9 > 6 ?

  • @E_rich
    @E_rich 4 года назад

    Damn, it's that simple, huh?

  • @MystyXsoul
    @MystyXsoul 8 лет назад

    TY!!!! :D