[jgrapht-users] Graph with loops and self-loop.

[raphaelrodrigues <rap...@gm...>]

Hi, i have a Graph with loops and self-loop. The objective is to get all the
possible paths.

With the algorithms provide by JgraphT, i can't pass through the loops. The
algorithms pass one time in the Vertex that has loops and after that the
algoritm don't get the other possible paths from this Vertex . 

For example, if i have:
A->B
A->A
A->C

B->A

>From (A To C) I wanna get:
Path1: A ->B->A->C
Path2: A->C

With jgrapht i only get:
Path1: A-> C

What i wanna know is if there a possible way to find all the path with a
limit of depth maybe? Or the best way to deal with self loops and loops?

Thank you very much! 



--
View this message in context: http://jgrapht-users.107614.n3.nabble.com/Graph-with-loops-and-self-loop-tp4024920.html
Sent from the jgrapht-users mailing list archive at Nabble.com.