Use visited map like a stack to walk full tree (including duplicate pointers) #4

myshkin5 · 2023-05-14T22:55:59Z

Note the hash will in some cases take longer to calculate with this change. Previously it would never walk a object more than once. But with this change it will never walk the same object more than once per depthwise. The change should use slightly less memory though.

Fixes #3

…ointers)

Use visited map like a stack to walk full tree (including duplicate p…

fdf7d72

…ointers)

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Use visited map like a stack to walk full tree (including duplicate pointers) #4

Use visited map like a stack to walk full tree (including duplicate pointers) #4

myshkin5 commented May 14, 2023

Use visited map like a stack to walk full tree (including duplicate pointers) #4

Are you sure you want to change the base?

Use visited map like a stack to walk full tree (including duplicate pointers) #4

Conversation

myshkin5 commented May 14, 2023