Github user kayousterhout commented on the pull request:
https://github.com/apache/spark/pull/12655#issuecomment-214619200
I see -- now I understand the motivation for returning the shuffle
dependencies topologically sorted, because it limits the depth of the recursion
(it looks like the old code was trying to do that with the stack, but didn't
quite get it right?). Let me think about whether there's a simpler way to
accomplish that.
---
If your project is set up for it, you can reply to this email and have your
reply appear on GitHub as well. If your project does not have this feature
enabled and wishes so, or if the feature is enabled but not working, please
contact infrastructure at infrastruct...@apache.org or file a JIRA ticket
with INFRA.
---
---------------------------------------------------------------------
To unsubscribe, e-mail: reviews-unsubscr...@spark.apache.org
For additional commands, e-mail: reviews-h...@spark.apache.org
