Re: [jgrapht-users] Get all paths

[Joris K. <de...@gm...>]

You need to be more specific. Do you want all edge disjoint, or vertex
disjoint paths, or just all paths that hare different from each other? Note
that finding all paths between two nodes is NP-hard. Devising an algorithm
to do so is however not necessarily very difficult. See e.g.:
http://stackoverflow.com/questions/9535819/find-all-paths-between-two-graph-nodes

For a number of easy-to-implement algorithms for finding edge/node disjoint
graphs and several variations, see:  Bhandari, Ramesh (1999),  *Survivable
Networks: Algorithms for Diverse Routing*, Springer-Verlag,  ISBN
<http://en.wikipedia.org/wiki/International_Standard_Book_Number>
978-0-7923-8381-9
<http://en.wikipedia.org/wiki/Special:BookSources/978-0-7923-8381-9>

br,

Joris Kinable


On Fri, Aug 29, 2014 at 2:16 PM, irisDeveloper <dev...@gm...>
wrote:

> Hi all,
>
> I want set of all the paths between any two vertices . Can anybody help me.
>
> Thanks
> Samby
>
>
>
> ------------------------------------------------------------------------------
> Slashdot TV.
> Video for Nerds.  Stuff that matters.
> http://tv.slashdot.org/
> _______________________________________________
> jgrapht-users mailing list
> jgr...@li...
> https://lists.sourceforge.net/lists/listinfo/jgrapht-users
>