Cannot understand the detailedly the following code
gagsl-py2 at yahoo.com.ar
Fri Apr 11 01:27:55 EDT 2008
En Thu, 10 Apr 2008 23:57:29 -0300, <reachmsn at hotmail.com> 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
More information about the Python-list