Re: [jgrapht-users] How to EdmondsKarp using capacity instead of edge weight

[Gábor S. <gab...@gm...>]

Hi Joris,

In JGraphT is it possible to get the minimum weight path between two
vertices?

I'm not sure that the Dijkstra is considering edge weights.

If not, how do I get the lowest weighted path?
Do you have any idea?

Thanks,
Gábor

Joris Kinable <j.k...@gm...> ezt írta (időpont: 2021. szept. 30.,
Cs, 5:15):

> See the response here:
> https://stackoverflow.com/questions/69380229/jgrapht-how-to-use-my-custom-made-edge-implementation-with-edmondskarp-max-flo/69385637#69385637
>
> On Tue, Sep 28, 2021 at 7:36 AM Gábor Szegedi <gab...@gm...>
> wrote:
>
>> Dear Fellow JGraphT Users,
>>
>> I'm writing to you because I found something that I do not understand,
>> and I need your help.
>>
>> So my findings are that the EdmondsKarpMFImpl
>> <https://jgrapht.org/javadoc/org.jgrapht.core/org/jgrapht/alg/flow/EdmondsKarpMFImpl.html>
>> is using the Edge weight as the capacity. But in that case how do you
>> assign an upper bound to the capacity?
>> Or how can I 'ask' the algorithm to use another field (which is
>> implemented in my implementation of the DefaultWeightedEdge) as a capacity
>> instead of the edge weight.
>>
>> I'm really hoping that someone could help me, it would require for my
>> thesis.
>>
>> Cheers and Looking forward to hearing from you,
>> Gabe
>> _______________________________________________
>> jgrapht-users mailing list
>> jgr...@li...
>> https://lists.sourceforge.net/lists/listinfo/jgrapht-users
>>
>