0

I have a list of Activities and a list of Activities and the Start Activity, which I am supposedly fetching by parsing an XML.

Now I need to find the Possible Paths from Start to End in Java.

I googled some algo's that could do the same but, Dijkstra requires a directed conencted graph(which we dont have) and others are search and traversal algo's.

Please help.

user2176576
  • 734
  • 3
  • 14
  • 39
  • you may use JGraph in order to build the graph from the XML containing the data; then on the created graph you can use all the JGraph algorithms – Angelo Immediata Apr 29 '14 at 07:13
  • This seems to display a graph, Let me rephrase, I do not wish to display the graph, just to use it internally to find all possible paths from source to Destination.Also request you to provide a link for your suggestion,that would be helpful! – user2176576 Apr 29 '14 at 07:18

0 Answers0