I think that the question is self explanatory.
1 Answer
$\begingroup$
$\endgroup$
As always there are multiple ways to do this. Here is the most flexible:
Basicly you give each polygon a number (distance to the point) which will be used as sorting key in the Sort List node.
The first element in the polygon list and the first element in the distances list belong to each other, same with the second, etc.