We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
unionFind class method find has extra step. It does compression even if it is not needed.
while (p != root) { int next = id[p]; id[p] = root; p = next; } can be modified to the following to bypass unnecessary step
while (p != root) { int next = id[p]; id[p] = root; p = next; }
while (id[p] != root) { int next = id[p]; id[p] = root; p = next; }
The text was updated successfully, but these errors were encountered:
No branches or pull requests
unionFind class method find has extra step. It does compression even if it is not needed.
while (p != root) { int next = id[p]; id[p] = root; p = next; }
can be modified to the following to bypass unnecessary step
while (id[p] != root) { int next = id[p]; id[p] = root; p = next; }
The text was updated successfully, but these errors were encountered: