Please allow ads on our site
LoginMost efficient way to recompute flow in a graph after changing capacity of one edge
Course Queries Syllabus Queries 3 years ago
User submissions are the sole responsibility of contributors, with TuteeHUB disclaiming liability for accuracy, copyrights, or consequences of use; content is for informational purposes only and not professional advice.
No matter what stage you're at in your education or career, TuteeHUB will help you reach the next level that you're aiming for. Simply,Choose a subject/topic and get started in self-paced practice sessions to improve your knowledge and scores.
Similar Forum
Explore Other Libraries
Online Exams
Question Bank
Career News
Feeds
Full Forms
Dictionary
Interview Question
Gigs
Quotes
Lyrics
Videos
Courses
Blogs
Tutorials
Forum
Educators
Corporates
Tools
manpreet![Tuteehub forum best answer]()
Best Answer
3 years ago
What is the most efficient way to recompute maximum flow in a graph when:
In the first case, is is enough to run one iteration of Ford-Fulkerson algorithm? In the second case, we need to recompute maximum flow only if the edge is part of a set of edges of maximum flow. Is it also enough to run one iteration of Ford-Fulkerson?