Add constraints in Max-flow

Asked Jun 18 '14 at 17:34

Active Jun 18 '14 at 20:07

Viewed 177 times

I'm trying to find k(k is given) path using Max-flow from source node s to destination node t with some constraints in graph G= (V, E). Given Different subsets A_i of V, One subset can have one or more than one nodes. Problem is i can use one subset only in one path. I'm using this code Finding max-flow

How can i add each subset only can use one path in this code (i mean if i use subset A_1 in path 1 then i can't use A_1 again for other paths ? I'm new in java. I tried to upload my problem picture but i couldn't because i'm new for this side. Thanks

asked Jun 18 '14 at 17:34

user3745549

One "pragmatic" approach could be: When a flow uses a vertex from subset A1, then simply remove all vertices of A1 from V before computing the next flow.... – Marco13 Jun 18 '14 at 17:51
@Marco13 Right now that sounds like a bad idea to me because you can't know in advance that the path you picked is in some maximal flow. – G. Bach Jun 18 '14 at 20:03
I'm agree with @G. Bach. But how can i solve this problem? – user3745549 Jun 18 '14 at 20:08
Do the edges in G all have capacity 1 or are the capacities arbitrary? – G. Bach Jun 18 '14 at 20:08
Yes, all capacity 1 and A_i is not necessarily connected. – user3745549 Jun 18 '14 at 20:15

Add constraints in Max-flow

0 Answers0