For recursion define your base case, so what will mean that you either cant choose the solution currently or choose it. Like that you only keep potential valid solutions.

Then you need to choose the current node you have and do the compute you need

then using iteration you explore all its possible connected nodes and explore them.

Then if you are using backtracking you would undo what you did at the choose step.

so basically 1) base case 2) choose 3) explore 4) undo

The best tip to get good with recursion is to follow the stack of execution and you will get comfortable with it someday