We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
Just implement what you find in Wikipedia about ranked union find - you don't even need the path compression part, which seems to be counter-productive in pure functional implementations.
Prison Transport
You are viewing a single comment's thread. Return to all comments →
Just implement what you find in Wikipedia about ranked union find - you don't even need the path compression part, which seems to be counter-productive in pure functional implementations.