Algorithms Computing

Algorithms } 032 } Graphs } Flow Networks } Push-Relabel }

This lecture discusses Push-Relabel approach for solving flow network problems. Generic flow-network algorithm has been discussed.

[ ►Subscribe ] Leprofesseur } on YouTube. We appreciate your feedback and support. Do not forget to give thumbs-up 🙂



Nicklas Dohrn pointed this error:
“Hey there, great video and one of the only videos that really explains this topic in depth.
i think there might be a slight error, when you increase L and P and it finally meets the height of s, you increase h(L) from 6 to 8, but the min(h(s),h(p)) is 6 so the new height should be only 7 correct?
this would also prevent the confusion, why you push the flow back to s, if pushing it to p would also be a valid choice in your case with height 8)

 7,710 total views,  2 views today

Leave a Reply

Your email address will not be published. Required fields are marked *

This site uses Akismet to reduce spam. Learn how your comment data is processed.