The description, expected output, and A LOT of pre-done code is in the file provided so use that as...

Question

The description, expected output, and A LOT of pre-done code is in the file provided so use that as your guide. There is not nearly as much to do as it may look.This will be done in Java and I would like it done by tomorrow Tuesday. I want this code to be completely unique and not copied whatsoever or I will not except it.Don't use any extra imports that aren't already provided when doing this assignment.Description and files needed/dijkstra2.txt 7 0 1 10 0 4 1 1 2 0 1 3 5 2 3 2 3 0 3 3 4 17 3 6 7 4 5 7 6 5 2 Description and files needed/HeapSortOutput.txt *** Integer Heap Sort *** Original array: [360, 448, 29, 447, 15, 53, 491, 261, 219, 354] After sorting:  [15, 29, 53, 219, 261, 354, 360, 447, 448, 491] *** String Heap Sort *** Original array: [abc, def, abcd, bce, abx, acfe, bfr, xyz, de, tyu, ab, abcd, xy, zxy, abx, def] After sorting:  [ab, abc, abcd, abcd, abx, abx, acfe, bce, bfr, de, def, def, tyu, xy, xyz, zxy] *** Student Heap Sort *** Original Order: [(B, 88), (I, 77), (K, 77), (D, 87), (E, 83), (J, 88), (F, 78), (G, 93), (H, 91), (C, 77), (A, 78)] After Sorting:  [(C, 77), (I, 77), (K, 77), (A, 78), (F, 78), (E, 83), (D, 87), (B, 88), (J, 88), (H, 91), (G, 93)] Description and files needed/UnionFind.java Description and files needed/UnionFind.java import java.util.ArrayList; public class UnionFind {     private ArrayList> representatives;     public UnionFind(int initialNumSets) { // complete this constructor      }     public void makeSet(int x) { // complete this method     }     public ArrayList find(int x) { // complete this method     }     private void append(ArrayList arg1, ArrayList arg2) { // complete this method     }     public void doUnion(int x, int y) { // complete this method     } } Description and files needed/GenericHeapSort.java Description and files needed/GenericHeapSort.java import java.io.FileNotFoundException; import java.util.ArrayList; import java.util.Arrays; import java.util.PriorityQueue; public class GenericHeapSort {     public static void sort(int[] arr, int len) {         // creates a priority queue using the PriorityQueueComparator         PriorityQueue heap = new PriorityQueue(new PriorityQueuePairComparator());         for (int i = 0; i  0) { // as long as the heap is not empty             PriorityQueuePair ele = heap.peek(); // get the topmost item             heap.remove(); // remove the topmost item             arr[i++] = ele.item; // could also use ele.priority         }     }     public static void sort(String[] arr, int len) {         // creates a priority queue using the StringComparator         PriorityQueue heap = new PriorityQueue(new StringComparator());         for (int i = 0; i  0) { // as long as the heap is not empty             String ele = heap.peek(); // get the topmost item             heap.remove(); // remove the topmost item             arr[i++] = ele;         }     }     private static void sortStudents() throws FileNotFoundException {         System.out.println("
*** Student Heap Sort ***
");         ArrayList students = IOHelper.readStudents("students.txt");         System.out.println("Original Order: " + students);         // creates a priority queue using the StudentComparator         PriorityQueue heap = new PriorityQueue(new StudentComparator());         for (int i = 0; i  sortedStudents = new ArrayList();         while (heap.size() > 0) { // as long as the heap is not empty             Student ele = heap.peek(); // get the topmost item             heap.remove(); // remove the topmost item             sortedStudents.add(ele);         }         System.out.println("After Sorting:  " + sortedStudents);     }     static void stringSort() {         System.out.println("
*** String Heap Sort ***
");         String arr[] = { "abc", "def", "abcd", "bce", "abx", "acfe", "bfr", "xyz", "de", "tyu", "ab", "abcd", "xy",                 "zxy", "abx", "def" };         System.out.println("Original array: " + Arrays.toString(arr));         sort(arr, arr.length);         System.out.println("After sorting:  " + Arrays.toString(arr));     }     static void integerSort() {         System.out.println("*** Integer Heap Sort ***
");         int[] arr = {360, 448, 29, 447, 15, 53, 491, 261, 219, 354};         System.out.println("Original array: " + Arrays.toString(arr));         sort(arr, arr.length);         System.out.println("After sorting:  " + Arrays.toString(arr));     }     public static void main(String[] args) throws FileNotFoundException {         integerSort();         stringSort();         sortStudents();     } } Description and files needed/GenericSelectionSortOutput.txt *** String Selection Sort *** Original Order: abc def abcd bce abx acfe bfr xyz de tyu ab abcd xy zxy abx def  After Sorting:  ab abc abcd abcd abx abx acfe bce bfr de def def tyu xy xyz zxy  *** Student Selection Sort *** Original Order: (B, 88) (I, 77) (K, 77) (D, 87) (E, 83) (J, 88) (F, 78) (G, 93) (H, 91) (C, 77) (A, 78)  After Sorting:  (C, 77) (I, 77) (K, 77) (A, 78) (F, 78) (E, 83) (D, 87) (B, 88) (J, 88) (H, 91) (G, 93)  Description and files needed/PriorityQueueApplications.java Description and files needed/PriorityQueueApplications.java import java.util.ArrayList; import java.util.Arrays; import java.util.PriorityQueue; public class PriorityQueueApplications {     public static ArrayList topK(ArrayList students, int k) { // complete this method     }     public static ArrayList kWayMerge(ArrayList> lists) { // complete this method     } } Description and files needed/PriorityQueuePairComparator.java Description and files needed/PriorityQueuePairComparator.java import java.util.Comparator; public class PriorityQueuePairComparator implements Comparator {     @Override     public int compare(PriorityQueuePair o1, PriorityQueuePair o2) {         return o1.priority - o2.priority;     } } Description and files needed/StudentComparator.java Description and files needed/StudentComparator.java import java.util.Comparator; public class StudentComparator implements Comparator { // complete this class } Description and files needed/dijkstra1.txt 7 0 1 10 0 3 3 0 4 7 1 2 0 1 3 5 2 0 17 3 2 17 3 4 2 3 6 7 5 4 3 5 6 2 Description and files needed/GenericSelectionSort.java Description and files needed/GenericSelectionSort.java import java.io.FileNotFoundException; import java.util.ArrayList; import java.util.Comparator; public class GenericSelectionSort { // A generic class for selection sorting comparable objects     Comparator comparator; // This is used to compare the objects of the class     GenericSelectionSort(Comparator comparator) { // Constructor will set the comparator for the specific class         this.comparator = comparator;     }     public void sort(ArrayList content) {         for (int i = 0; i  0 means currentValue is larger than minValue                     minIndex = j;                 }             }             // swap contents             T temp = content.get(minIndex);             content.set(minIndex, content.get(i));             content.set(i, temp);         }     }     private static void stringSort() {         System.out.println("*** String Selection Sort ***
");         String arr[] = { "abc", "def", "abcd", "bce", "abx", "acfe", "bfr", "xyz", "de", "tyu", "ab", "abcd", "xy",                 "zxy", "abx", "def" };         ArrayList strings = new ArrayList();         for (String str : arr)             strings.add(str);         GenericSelectionSort stringSelectionSort = new GenericSelectionSort(new StringComparator());         System.out.print("Original Order: ");         for (String str : strings)             System.out.print(str + " ");         stringSelectionSort.sort(strings);         System.out.print("
After Sorting:  ");         for (String str : strings)             System.out.print(str + " ");         System.out.println("
");     }     private static void studentSort() throws FileNotFoundException {         System.out.println("*** Student Selection Sort ***
");         ArrayList students = IOHelper.readStudents("students.txt");         System.out.print("Original Order: ");         for (Student student : students)             System.out.print(student.toString() + " ");         // Create selection sort instance for sorting Students using the StudentComparator         GenericSelectionSort studentSelectionSort = new GenericSelectionSort(new StudentComparator());         studentSelectionSort.sort(students);         System.out.print("
After Sorting:  ");         for (Student student : students)             System.out.print(student.toString() + " ");     }     public static void main(String[] args) throws FileNotFoundException {         stringSort();         studentSort(); // this will work only if the StudentComparator and readStudents methods are complete.     } } Description and files needed/StringComparator.java Description and files needed/StringComparator.java import java.util.Comparator; public class StringComparator implements Comparator {     @Override     public int compare(String arg1, String arg2) {         return arg1.compareTo(arg2);     } } Description and files needed/IOHelper.java Description and files needed/IOHelper.java import java.io.FileReader; import java.io.FileNotFoundException; import java.util.ArrayList; import java.util.Scanner; public class IOHelper {     public static ArrayList readStudents(String filePath) throws FileNotFoundException { // complete this method     }     public static Graph readWeightedGraph(String filePath) throws FileNotFoundException { // complete this method     } } Description and files needed/PriorityQueuePair.java Description and files needed/PriorityQueuePair.java public class PriorityQueuePair {     public int item;     public int priority;          public PriorityQueuePair(int item, int priority) {         this.item = item;         this.priority = priority;     } } Description and files needed/TestCorrectness.java Description and files needed/TestCorrectness.java import java.util.ArrayList; import java.util.Arrays; public class TestCorrectness {     static final String DIJKSTRA1 = "dijkstra1.txt";     static final String DIJKSTRA2 = "dijkstra2.txt";     static final String STUDENT = "students.txt";     private static ArrayList> arraysToLists(int[][] arrays, int arrayLengths[], int n) {         ArrayList> lists = new ArrayList>(n);         for (int i = 0; i  list = new ArrayList(arrayLengths[i]);             for (int j = 0; j  students = IOHelper.readStudents(STUDENT);         System.out.printf("Original Array:     %s%n", students);         ArrayList top3 = PriorityQueueApplications.topK(students, 3);         ArrayList top7 = PriorityQueueApplications.topK(students, 7);         ArrayList all = PriorityQueueApplications.topK(students, students.size());         System.out.print("Highest 3 students: " + top3);         System.out.println();         System.out.print("Highest 7 students: " + top7);         System.out.println();         System.out.printf("All students:       " + all);     }     private static void testKSortedMerge() {         System.out.println("

*** Test Merging k Sorted Arrays ***
");         int list0[] = { 1, 5, 9, 18 };         int list1[] = { -10, 5, 18, 67, 100 };         int list2[] = { -12, -9, -6, 0, 1, };         int list3[] = { -65, -32, 10, };         int list4[] = { 1, 19, 45, 67 };         int lists[][] = { list0, list1, list2, list3, list4 };         int k = lists.length;         int eachListLength[] = new int[k];         for (int i = 0; i  mergedList = PriorityQueueApplications.kWayMerge(arraysToLists(lists, eachListLength, k));         System.out.println("Original sorted arrays");         for (int i = 0; i

Kshitij · Accepted Answer

Assign/Dijkstra.java Assign/Dijkstra.java import java.io.IOException; import java.util.Arrays; import java.util.PriorityQueue; import static June.jun28_21.IOHelper.readWeightedGraph; public class Dijkstra extends Graph { private final boolean[] closed; public int[] distance, parent; public Dijkstra(String filePath) throws IOException { Graph myGraph = readWeightedGraph(filePath); this.numVertices = myGraph.numVertices; this.adjList = myGraph.adjList; distance = new int[myGraph.numVertices]; parent = new int[myGraph.numVertices]; closed = new boolean[myGraph.numVertices]; } public void execute(int source) { // complete this method Arrays.fill(distance, Integer.MAX_VALUE); Arrays.fill(parent, -1); distance[source] = 0; PriorityQueue priQueue = new PriorityQueue(); priQueue.add(new Edge(-1, source, 0)); parent[source] = -1; while (!priQueue.isEmpty()) { Edge node = priQueue.remove(); for (Edge itr : adjList.get(node.dest)) { if (distance[itr.dest] > itr.weight + distance[node.dest]) { distance[itr.dest] = itr.weight + distance[node.dest]; priQueue.add(new Edge(itr.src, itr.dest, distance[itr.dest])); parent[itr.dest] = itr.src; } } } } } Assign/dijkstra1.txt 7 0 1 10 0 3 3 0 4 7 1 2 0 1 3 5 2 0 17 3 2 17 3 4 2 3 6 7 5 4 3 5 6 2 Assign/dijkstra2.txt 7 0 1 10 0 4 1 1 2 0 1 3 5 2 3 2 3 0 3 3 4 17 3 6 7 4 5 7 6 5 2 Assign/Edge.java Assign/Edge.java public class Edge implements Comparable { int src, dest, weight; public Edge(int src, int dest, int weight) { this.src = src; this.dest = dest; this.weight = weight; } public String toString() { return String.format("<%d, %d, %d>", src, dest, weight); } @Override public int compareTo(Edge o) { return Integer.compare(o.weight, this.weight); } } Assign/GenericHeapSort.java Assign/GenericHeapSort.java import java.io.IOException; import java.util.ArrayList; import java.util.Arrays; import java.util.PriorityQueue; public class GenericHeapSort { public static void sort(int[] arr, int len) { // creates a priority queue using the PriorityQueueComparator PriorityQueue heap = new PriorityQueue<>(new PriorityQueuePairComparator()); for (int i = 0; i < len; i++) heap.add(new PriorityQueuePair(arr[i], arr[i])); // for plain heap sort, item and priority is the same; int i = 0; while (heap.size() > 0) { // as long as the heap is not empty PriorityQueuePair ele = heap.peek(); // get the topmost item heap.remove(); // remove the topmost item arr[i++] = ele.item; // could also use ele.priority } } public static void sort(String[] arr, int len) { // creates a priority queue using the StringComparator PriorityQueue heap = new PriorityQueue<>(new StringComparator()); for (int i = 0; i < len; i++) heap.add(arr[i]); int i = 0; while (heap.size() > 0) { // as long as the heap is not empty String ele = heap.peek(); // get the topmost item heap.remove(); // remove the topmost item arr[i++] = ele; } } private static void sortStudents() throws IOException { System.out.println(" *** Student Heap Sort *** "); ArrayList students = IOHelper.readStudents("students.txt"); System.out.println("Original Order: " + students); // creates a priority queue using the StudentComparator PriorityQueue heap = new PriorityQueue<>(new StudentComparator()); for (int i = 0; i < students.size(); i++) heap.add(students.get(i)); ArrayList sortedStudents = new ArrayList<>(); while (heap.size() > 0) { // as long as the heap is not empty Student ele = heap.peek(); // get the topmost item heap.remove(); // remove the topmost item sortedStudents.add(ele); } System.out.println("After Sorting: " + sortedStudents); } static void stringSort() { System.out.println(" *** String Heap Sort *** "); String arr[] = {"abc", "def", "abcd", "bce", "abx", "acfe", "bfr", "xyz", "de", "tyu", "ab", "abcd", "xy", "zxy", "abx", "def"}; System.out.println("Original array: " + Arrays.toString(arr)); sort(arr, arr.length); System.out.println("After sorting: " + Arrays.toString(arr)); } static void integerSort() { System.out.println("*** Integer Heap Sort *** "); int[] arr = {360, 448, 29, 447, 15, 53, 491, 261, 219, 354}; System.out.println("Original array: " + Arrays.toString(arr)); sort(arr, arr.length); System.out.println("After sorting: " + Arrays.toString(arr)); } public static void main(String[] args) throws IOException { integerSort(); stringSort(); sortStudents(); } } Assign/GenericSelectionSort.java Assign/GenericSelectionSort.java import java.io.IOException; import java.util.ArrayList; import java.util.Comparator; public class GenericSelectionSort { // A generic class for selection sorting comparable objects Comparator comparator; // This is used to compare the objects of the class GenericSelectionSort(Comparator comparator) { // Constructor will set the comparator for the specific class this.comparator = comparator; } private static void stringSort() { System.out.println("*** String Selection Sort *** "); String arr[] = {"abc", "def", "abcd", "bce", "abx", "acfe", "bfr", "xyz", "de", "tyu", "ab", "abcd", "xy", "zxy", "abx", "def"}; ArrayList strings = new ArrayList(); for (String str : arr) strings.add(str); GenericSelectionSort stringSelectionSort = new GenericSelectionSort<>(new StringComparator()); System.out.print("Original Order: "); for (String str : strings) System.out.print(str + " "); stringSelectionSort.sort(strings); System.out.print(" After Sorting: "); for (String str : strings) System.out.print(str + " ");

Description and files needed/dijkstra2.txt 7 0 1 10 0 4 1 1 2 0 1 3 5 2 3 2 3 0 3 3 4 17 3 6 7 4 5 7 6 5 2 Description and files needed/HeapSortOutput.txt * Integer Heap Sort * Original array:...

Answer To: Description and files needed/dijkstra2.txt 7 0 1 10 0 4 1 1 2 0 1 3 5 2 3 2 3 0 3 3 4 17 3 6 7 4 5 7...

Answer To This Question Is Available To Download

Related Questions & Answers

Submit New Assignment

Description and files needed/dijkstra2.txt 7 0 1 10 0 4 1 1 2 0 1 3 5 2 3 2 3 0 3 3 4 17 3 6 7 4 5 7 6 5 2 Description and files needed/HeapSortOutput.txt *** Integer Heap Sort *** Original array:...

Answer To: Description and files needed/dijkstra2.txt 7 0 1 10 0 4 1 1 2 0 1 3 5 2 3 2 3 0 3 3 4 17 3 6 7 4 5 7...

Answer To This Question Is Available To Download

Related Questions & Answers

Submit New Assignment

Description and files needed/dijkstra2.txt 7 0 1 10 0 4 1 1 2 0 1 3 5 2 3 2 3 0 3 3 4 17 3 6 7 4 5 7 6 5 2 Description and files needed/HeapSortOutput.txt * Integer Heap Sort * Original array:...