[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