I dont think max flow would work, because a max flow of 'k' will guarantee atleast k "edges" and not vertices. It is easy to come up with a case where removal of just one vertex will disconnect a graph with max flow of 'k'.
On the other hand, I think the BFS would work pretty well, just ensuring that each time you remove "vertices" in the path and not "edges". -Dhyanesh On 4/25/06, forest <[EMAIL PROTECTED]> wrote: > > you can not use BFS to find out if there are k disjoint paths between 2 > vertices. It can be done by finding maximum flow and comparing it to > k. > > > > > --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
