Maximum Flow and Minimum Cut of a Network

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

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

  • @naeemult
    @naeemult 3 ปีที่แล้ว +2

    Thanks, this helped a lot! What a shortcut haha

  • @saatvik6409
    @saatvik6409 7 หลายเดือนก่อน +1

    Thnx a lot.... beautifully explained ❤

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

    hi thanks for the explanation i got a doubt what will be the vertices for minimum cut ?? two set of vertices ??

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

    If there are duplicate numbers along a path, for example two 6s, do you cross both out and add both of them at the end or just add one 6?

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

    thank you :)

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

    What do u think

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

    Hi, your third cut in the 2nd example is wrong becuase the flow is flowing from below to above whih shouldn't be considered. Always from above to below. If I am wrong please correct!

    • @EmDickinson
      @EmDickinson  ปีที่แล้ว +5

      Hi Kiran, we always count edges that flow from the side of the source to the side of the sink, not "above" or "below".

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

    According to your views your subscribers are soooooooooo less

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

      chinmay's world I didn’t upload any videos for 6 years so it’s not surprising!

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

      @@EmDickinson because of lockdown?

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

      Rahul Bhatia I’m uploading now because I’m teaching my students online.

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

      @@rahulbhatia1313 bhai karde subscribe

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

      @@EmDickinson glad to see that you're back :) from high school to uni i have seen your videos!