Thanks for sharing!
I think that by using this approach, it's also possible to detect circular dependencies, i.e. if the current visited node is already in the set, it means there is a circular dependency.
Yeah, definitely you can track that down using this approach! 😀
Are you sure you want to hide this comment? It will become hidden in your post, but will still be visible via the comment's permalink.
Hide child comments as well
Confirm
For further actions, you may consider blocking this person and/or reporting abuse
We're a place where coders share, stay up-to-date and grow their careers.
Thanks for sharing!
I think that by using this approach, it's also possible to detect circular dependencies, i.e. if the current visited node is already in the set, it means there is a circular dependency.
Yeah, definitely you can track that down using this approach! 😀