在六角形网格中找到所有长度为n的可能路径

假设您定义了以下递归函数，返回一个成对列表的列表，其中每个成对列表都是从

from

to

i

find_paths_from_to_with_length(from, to, i):    if i == 1:        if to in neighbors(from) or from == to: return [[(from, to)]]        return []    all_paths = []    for node in neighbors(from) + [from]:        neighbor_all_paths = find_paths_from_to_with_length(node, to, i - 1)        for path in neigbor_all_paths: all_paths.append([(from, node)] + neighbor_path    return all_paths

然后，只需使用源，目标和所需的长度来调用它。