Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
I know generally you go from source to sink in a network flow graph, but I know there are specific algorithms to go from the sink to a desired node in a network flow graph (not including the source). Could anybody suggest an algorithm that could do this? It’s been a while since I’ve taken an algorithms class and I’m a little rusty on how to go about this one.
If you want to find a flow from the sink to a vertex A, just set
new_source := sinkandnew_sink = Aand run the algorithm of your choice.