-4
$\begingroup$

Given a flow network and M the maximum number of node-disjoints paths from s to t, how can I implement an algorithm that computes those M paths ? I thought of iterating breadth first search to find paths (and gradually removing the nodes of the path just found from the graph) but I don't know how to find the M paths.

$\endgroup$

Your Answer

By clicking "Post Your Answer", you acknowledge that you have read our updated terms of service, privacy policy and cookie policy, and that your continued use of the website is subject to these policies.

Browse other questions tagged or ask your own question.