Recursion, generate all pyramid-paths, not working

process circularfunc at
Sat Oct 4 16:17:41 CEST 2008

def recur(tree, pos):
    if not tree:
        return []
        return [[tree[0][pos]] + recur(tree[1:], pos)] + \
               [[tree[0][pos]] + recur(tree[1:], pos+1)]

i have a list with [[1],[2,3],[4,5,6],[7,8,9,10]]

it i a pyramid so first is 1 then 23 then 456 thrn 78910

from one can go to 2 or 3. from 2 to 4or5, from 3 to 5 or 6.

i want to generate every path and compute the cost.

But I can't get the recursion right. It generates all the paths kind
of but not in a matter i want to.

also having to return after each other doesnt do anything right?
like so:
return [[tree[0][pos]] + recur(tree[1:], pos)]
return [[tree[0][pos]] + recur(tree[1:], pos+1)]

More information about the Python-list mailing list