Re: [Tutor] Depth First Search Listing all possible combinations

2013-11-25 Thread Randolph Scott-McLaughlin II
I solved the question thanks to Alan's suggestions. Attached is the .py file I ran to solve my question. Thanks guys. On Sat, Nov 23, 2013 at 8:41 PM, Randolph Scott-McLaughlin II < randolph.michael...@gmail.com> wrote: > So I cleaned up the code to make it readable. I'm not getting an error >

Re: [Tutor] Depth First Search Listing all possible combinations

2013-11-24 Thread Danny Yoo
You have at least one error in your graph. Specifically, if you are using: ### graph = {'q9': ['q10', 'q33'], 'q10': ['q11', 'q 28', 'q29', 'q30'], 'q11': ['q15'] , 'q16': ['q17', 'q19', 'q24'],' q18': ['q20'], 'q23': ['q34'], 'q24': [

Re: [Tutor] Depth First Search Listing all possible combinations

2013-11-24 Thread Randolph Scott-McLaughlin II
So I cleaned up the code to make it readable. I'm not getting an error message now. What I'm getting is an empty bracket. I want to run find_all_paths with my graph and then list the start and end point (in this case that's q9 and q42) and then have it list a tuple of each path in a separate line.

Re: [Tutor] Depth First Search Listing all possible combinations

2013-11-23 Thread Alan Gauld
On 23/11/13 21:30, Randolph Scott-McLaughlin II wrote: Inline image 2Inline image 1Hi Tutors, So I'm writing code for a depth first search where I have 1 start point and 1 end point. Between those points there are a series of 1-way roads that goes from one vertex to the next. Sometimes the verte