The program finds the connected components in the graph having complexity O(E ) where E is the number of edges, V is the number of vertices and α(x) is the inverse Ackerman function.
Fixes #(issue_no)
Replace issue_no with the issue number which is fixed in this PR
Type of change
Please delete options that are not relevant.
[ ] Bug fix (non-breaking change which fixes an issue)
[ ] New feature (non-breaking change which adds functionality)
[ ] Breaking change (fix or feature that would cause existing functionality to not work as expected)
[ ] This change requires a documentation update
[ ] Documentation Update
Checklist:
[ . ] My code follows the style guidelines(Clean Code) of this project
[ . ] I have performed a self-review of my own code
[ . ] I have commented my code, particularly in hard-to-understand areas
[ ] I have created a helpful and easy to understand README.md
[ ] I have made corresponding changes to the documentation
[ . ] My changes generate no new warnings
[ ] I have added tests/screenshots(if any) that prove my fix is effective or that my feature works
Description
The program finds the connected components in the graph having complexity O(E ) where E is the number of edges, V is the number of vertices and α(x) is the inverse Ackerman function.
Fixes #(issue_no)
Replace
issue_nowith the issue number which is fixed in this PRType of change
Please delete options that are not relevant.
Checklist:
README.md