[jgrapht-users] Any function to return all paths between two vertices?

[Jack G. <ja...@ya...>]

Hi, 

Is there any class that returns me all paths that lead from vertice X to Y? 

I saw that there a couple of algorithms such as Dijkstra's but they all return 
*one* path from X to Y (in case of Dijkstra the shortest). 
 
The most interesting thing for me would be a functionality where I can define 
something like this:


"Given that I have an undirected graph return me all possible paths from X to Y 
where the weight of the edges don't exceed a certain treshold!"

Thanks!

Gib