Kruskal.cpp Improvements

[KrishanKantAgnihotri]

Detailed description

I can add union by rank and path compression implementation for this algorithm. Which is not there. This implementation will optimize the running time of this algorithm. Currently, this code root function works in O(n) which can be optimized to O(logn). Also, the join function does not implement union by rank properly.

Context

This will optimize the algorithm.

Possible implementation

Path compression and Union by the rank method.

Additional information

Please assign this task to me.

[github-actions]

This issue has been automatically marked as abandoned because it has not had recent activity. It will be closed if no further activity occurs. Thank you for your contributions.

[github-actions]

Please ping one of the maintainers once you add more information and updates here. If this is not the case and you need some help, feel free to ask for help in our Gitter channel or our Discord server. Thank you for your contributions!