Hi, you are rightm but I am not the one who is saying that it is max flow.
I am telling the same as you but in different way, the thread author is
mistaken.
Can you provide some more ideas? I have no idea that i can prove.
2009/9/30 Prabhu Hari Dhanapal
> @ Miroslav -
>
> I think you are mis
@ Miroslav -
I think you are mistaken, the max flow does return exactly wht you are
looking for.The max flow over a path is nothing but its maximum bottle
neck. A path having 100 edges would not mean than 100 beads can be
pushed into it. Its just like water flowing in pipes .. the f
ya something like finding different augmenting paths caluclating the max
flow.pls refer coreman.
On Wed, Sep 30, 2009 at 1:36 PM, Prabhu Hari Dhanapal <
dragonzsn...@gmail.com> wrote:
> This is something like a "Flow Network Problem" .
>
> In the problem , you are just required to push
I magine that there is max flow like 2, you have source and target connected
by two otherwise disjoint paths. But one path is very very long, for exemple
100 edges, and another one is just one edge, then you can push 2 beads in 2
steps, but you must ignore the long path. So the large flow does not
So at each step you can move any number of beads form some betwwen some
pairs (in particular more than one) of adjecent vertices?
It seems to be complicated problem.
IMHO it is about some routing strategy than graph flow.
If you do reduction to edge capacit, than the maximum flow and longest path
