C++ Solution to UVA 459 - Graph Connectivity Solution Union by Rank and Path Compression

Problem Link:

https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=400

These are my old codes I kept for visual explanations but I lost all the data. Since these are old codes I can not remember if I made any breaking changes to the code later. For the algorithm please see Introduction to Algorithms book.

Problem Explanation & Visalization:

TODO

Input & Output Explanation:

TODO

Input & Output:

  Input:1

E
AB
CE
DB
EC

  Output:2

More input and output in udebug:

https://www.udebug.com/UVa/459

Quickgrid