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

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

The closest thing is the KShortestsPaths algorithm.

JVS

On Mon, May 23, 2011 at 12:33 PM, Jack Gibson <ja...@ya...> wrote:
> 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
>
> ------------------------------------------------------------------------------
> What Every C/C++ and Fortran developer Should Know!
> Read this article and learn how Intel has extended the reach of its
> next-generation tools to help Windows* and Linux* C/C++ and Fortran
> developers boost performance applications - including clusters.
> http://p.sf.net/sfu/intel-dev2devmay
> _______________________________________________
> jgrapht-users mailing list
> jgr...@li...
> https://lists.sourceforge.net/lists/listinfo/jgrapht-users
>