Given a route with a start and end vertices, I wish find out all the paths, how should I do this?
Share
Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
Given a route with a start and end vertices, I wish find out all the paths, how should I do this?
Run DFS from the starting vertex, passing the list of vertexes that you found so far down to the next invocation level. Print the list upon reaching the end vertex, and continue with the DFS until all paths have been enumerated.