Description: write an application UFApp that
1. Prompts for a file name.
2. Reads the first integer, which is the number of sites.
3. Reads each pair of integers, p and q, representing sites and if not already connected, connects by calling union(p,q).
4. At end of input, print
a. the number of sites
b. the number of components
c. the elapsed time in milliseconds to read an process all input pairs of sites (step 2)
Run the application for each of QF, QU and QUPC for input files of size 1K, 2K, 4K, 8K, 16K, 32K, 64K, 128K as long as the time is not greater than 10 seconds (10000 msec). Provide a text file with the results.
To Search:
File list (Check if you may need any files):
UFApp\HW6.docx
.....\hw6Data\128KUF.txt
.....\.......\16KUF.txt
.....\.......\1KUF.txt
.....\.......\2KUF.txt
.....\.......\32KUF.txt
.....\.......\4KUF.txt
.....\.......\64KUF.txt
.....\.......\8KUF.txt
.....\...JUnitTests\QFTest.java
.....\.............\QUPCTest.java
.....\.............\QUTest.java
.....\.............\UFApp.java
.....\solution\ans.txt
.....\........\ans.txt.bak
.....\........\QF.java
.....\........\QF.java.bak
.....\........\QU.java
.....\........\QU.java.bak
.....\........\QUPC.java
.....\........\QUPC.java.bak
.....\........\UF.java
.....\........\UF.java.bak
.....\hw6Data
.....\hw6JUnitTests
.....\solution
UFApp
Download