On Apr 11, 10:27 am, "Gabriel Genellina" <[EMAIL PROTECTED]> wrote: > En Thu, 10 Apr 2008 23:57:29 -0300, <[EMAIL PROTECTED]> escribió: > > > i.e. you give, the graph, the start and end vertices as inputs and you > > get the output as a listing of all the paths. This is where I got to. > > It would be very nice if you could kindly hint on how to proceed > > further. Thank you so much for your time! > > If you want to understand how recursion works, or how you can actually > construct a recursive function step by step, see this excellent post by > Neil Cerutti: > > http://groups.google.com/group/comp.lang.python/msg/9f0b10631fd47886 > > -- > Gabriel Genellina
Hi, I did read the post by Neil Cerutti, but I still am unable to write this recursive function. I will appreciate it if someone can kindly guide me. Thanks, Anshu -- http://mail.python.org/mailman/listinfo/python-list
