Extending the recursion limit in GHPython?

[AndersDeleuran]

Just a small note, maybe also consider implementing your algorithm using a while/for loop (if possible):

SelDup equivalent in python

Just as a side note: Recursion can be inherently slow in Python (depending in how you implement your algorithm). If possible, it is in my experience almost always faster to implement an iterative algorithm instead. Edit: Attached a simple example demonstrating this and how to avoid it using memoization (using GHPython): 170330_GHPython_CostOfRecursion_00.gh (7.3 KB)

Edit: I hadn’t properly understood the issue, but this might be useful none the less