• Status: Solved
  • Priority: Medium
  • Security: Public
  • Views: 307
  • Last Modified:

All possible path in a network

hello all, I want to find an algorithm that finds all possible path lengths from the other nodes to specifically node 1in the network. I already know about dijkstra's algorithm for finding the shortest path length, what I need is an algorithm that tells me all the possible paths that can be taken without going through the same node more than once for each path, I have attached a picture of my network just to give you a visual of what am working with.  can anyone help me
0
cowboy22
Asked:
cowboy22
  • 2
1 Solution
 
ozoCommented:
I don't see an attached picture, but this algorithm should do it
http://www.rci.rutgers.edu/~cfs/472_html/AI_SEARCH/ExhaustiveSearch.html
0
 
cowboy22Author Commented:
Thank you for the quick response, it was a little helpful but not what am looking for.  I have reposted the question with the graph attached.  the link you posted shows a way to one node if there are no other ways to get to it, what I need is an algorithm that finds all the ways to a node that has multiple ways of getting to it.
second-graph.jpg
0
 
ozoCommented:
the "nodes" in the link I posted represent "paths to a node" in your problem.
thus the algorithm finds all possible paths
0
Question has a verified solution.

Are you are experiencing a similar issue? Get a personalized answer when you ask a related question.

Have a better answer? Share it in a comment.

Join & Write a Comment

Featured Post

Get expert help—faster!

Need expert help—fast? Use the Help Bell for personalized assistance getting answers to your important questions.

  • 2
Tackle projects and never again get stuck behind a technical roadblock.
Join Now