Re: [jgrapht-users] Edmond Karp Problem
Brought to you by:
barak_naveh,
perfecthash
From: John S. <js...@gm...> - 2011-03-24 06:44:46
|
The implementation currently uses HashMap; we could change it to LinkedHashMap for determinism. JVS 2011/3/23 Alexandre Fréchette <fre...@gm...>: > Hi, > I am using jgrapht for its double-precision implementation of a maximum flow > algorithm. However, I am running > into a problem with the EdmondsKarpMaximumFlow object. I will create a > graph, find a maximum st-flow in that graph > and it will return a value. Then if I rerun my algorithm with the same data, > I will get a different value for the maximum flow. > Would you know what is causing the problem? > Alexandre Fréchette > > ------------------------------------------------------------------------------ > Enable your software for Intel(R) Active Management Technology to meet the > growing manageability and security demands of your customers. Businesses > are taking advantage of Intel(R) vPro (TM) technology - will your software > be a part of the solution? Download the Intel(R) Manageability Checker > today! http://p.sf.net/sfu/intel-dev2devmar > _______________________________________________ > jgrapht-users mailing list > jgr...@li... > https://lists.sourceforge.net/lists/listinfo/jgrapht-users > > |