jgrapht-users

[jgrapht-users] How-To: Find all ways in undirected graph

[Elena G. <ea...@gm...>]

Hi,

I have UndirectedGraph (may be with cycles) - and I need to find all
possible pathes between 2 vertexes. I think I need to change
BellmanFordIterator, but may be there is some existed code which I can use?

Thank you,
eagrin

Re: [jgrapht-users] How-To: Find all ways in undirected graph

[John V. S. <js...@gm...>]

You can try the new KShortestPaths algorithm (use the version in the
latest release, 0.7.3).

JVS

Elena Grinberg wrote:
> Hi,
>  
> I have UndirectedGraph (may be with cycles) - and I need to find all 
> possible pathes between 2 vertexes. I think I need to change 
> BellmanFordIterator, but may be there is some existed code which I can use?
> 
> Thank you,
> eagrin
> 
> 
> ------------------------------------------------------------------------
> 
> -------------------------------------------------------------------------
> This SF.net email is sponsored by: Microsoft
> Defy all challenges. Microsoft(R) Visual Studio 2008.
> http://clk.atdmt.com/MRT/go/vse0120000070mrt/direct/01/
> 
> 
> ------------------------------------------------------------------------
> 
> _______________________________________________
> jgrapht-users mailing list
> jgr...@li...
> https://lists.sourceforge.net/lists/listinfo/jgrapht-users

[jgrapht-users] How-To: Find all ways in undirected graph

[Elena G. <ea...@gm...>]

 Thank you, John, KShortestPaths from last release is what I need, works
great.
Elena