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

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

http://www.rci.rutgers.edu/~cfs/472_html/AI_SEARCH/ExhaustiveSearch.html