Critical Path Analysis Part 3: The Max-Flow/Min- Cut Theorem

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

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

  • @shabbyboy5173
    @shabbyboy5173 7 месяцев назад +1

    if I could give more likes I would, this helped so much

  • @zetopr8058
    @zetopr8058 11 месяцев назад +3

    Thank you very much, also you got a excellent style

    • @talkotlovker8226
      @talkotlovker8226 7 месяцев назад +1

      Agree, and he explains with emotion unlike many teachers

  • @mkhadka123
    @mkhadka123 5 лет назад +3

    What an easy to understand explanation of the theorem, so much better than my class lectures...Thank you Sir!!! You not only gave some useful concept but also probably helped me save my exams.

  • @MrKingoverall
    @MrKingoverall 4 года назад +1

    LOVE YOU MAN

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

    Love the explanation!

  • @harryparker3537
    @harryparker3537 5 лет назад +1

    Thank you, that was actually helpful.

  • @cruzinwithtom
    @cruzinwithtom 4 года назад +1

    Whose here night before

  • @乌雅成璧-g7m
    @乌雅成璧-g7m 4 года назад

    Chandler Bing is teaching math here haha

  • @ioshGNE
    @ioshGNE 4 месяца назад

    U WANT TO PLAY??? LETS PLAY

  • @Alicia0Cramel
    @Alicia0Cramel 4 года назад +3

    Hot

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

    This cuts not the best, your the best Dan!

  • @Aman-eq6iv
    @Aman-eq6iv 2 года назад

    This was a terrible explanation. Need to be more specific when going through the steps especially the second graph you are doing at 7 minutes and 30 seconds.