How to change this Java code to accept character value instead of integer for edges u and v: import java.util.*; public class Main { privateintV;// number of vertices privateArrayList> adj;// adjacency list privateclassEdge{ int v;// vertex int bandwidth;// bandwidth publicEdge(int v,int bandwidth){ this.v = v; this.bandwidth = bandwidth; } } publicMain(intV){ this.V=V; adj = new ArrayList>(V); for(int i =0; i ()); } } publicvoidaddEdge(int u,int v,int bandwidth){ adj.get(u).add(new Edge(v, bandwidth)); adj.get(v).add(new Edge(u, bandwidth)); } publicintmaxBandwidth(int a,int b){ PriorityQueue pq =newPriorityQueue(V,Collections.reverseOrder()); HashMap visited =newHashMap(); HashMap parent =newHashMap(); pq.add(a); visited.put(a, Integer.MAX_VALUE); parent.put(a, -1); while(!pq.isEmpty()){ int u = pq.poll(); if(u == b){ break; } for(Edge e : adj.get(u)){ int v = e.v; int bandwidth = e.bandwidth; if(!visited.containsKey(v)){ int minBandwidth =Math.min(visited.get(u), bandwidth); visited.put(v, minBandwidth); parent.put(v, u); pq.add(v); } } } int maxBandwidth = visited.get(b); int curr = b; ArrayList path =newArrayList(); while(curr !=-1){ path.add(0, curr); curr = parent.get(curr); } System.out.println("Maximum bandwidth path from "+ a +" to "+ b +": "+ path); return maxBandwidth; } public static void main(String[] args){ Main g = new Main(5); g.addEdge(0, 1, 10); g.addEdge(0, 2, 5); g.addEdge(1, 2, 7); g.addEdge(1, 3, 3); g.addEdge(2, 3, 2); g.addEdge(2, 4, 6); System.out.println("Maximum bandwidth from 0 to 4: " + g.maxBandwidth(0, 4));

PLEASE HELP, PYTHON THANK YOU def add_vertex(self, vertex): if vertex not in self.__graph_dict: self.__graph_dict[vertex] = [] def add_edge(self, edge): edge = set(edge) (vertex1, vertex2) = tuple(edge) ################# # Problem 4: # Check to see if vertex1 is in the current graph dictionary ################## #DELETE AND PUT IN THE IF STATEMENTS self.__graph_dict[vertex1].append(vertex2) else: self.__graph_dict[vertex1] = [vertex2] def __generate_edges(self): edges = [] ################# # Problem 5: # Loop through all of the data in the graph dictionary and use the variable vertex for the loop'ed data ################## #DELETE AND PUT IN THE LOOP STATEMENTS for neighbour in self.__graph_dict[vertex]: if {neighbour, vertex} not in edges: edges.append({vertex, neighbour}) return edges...

Consider the following class map, class map { public: map(ifstream &fin); void print(int,int,int,int); bool isLegal(int i, int j); void setMap(int i, int j, int n); int getMap(int i, int j) const; int getReverseMapI(int n) const; int getReverseMapJ(int n) const; void mapToGraph(graph &g); bool findPathRecursive(graph &g, stack<int> &moves); bool findPathNonRecursive1(graph &g, stack<int> &moves); bool findPathNonRecursive2(graph &g, queue<int> &moves); bool findShortestPath1(graph &g, stack<int> &bestMoves); bool findShortestPath2(graph &, vector<int> &bestMoves); void map::printPath(stack<int> &s); int numRows(){return rows;}; int numCols(){return cols;}; private: int rows; // number of latitudes/rows in the map int cols; // number of longitudes/columns in the map matrix<bool> value; matrix<int> mapping; // Mapping from latitude and longitude co-ordinates (i,j) values to node index...

Code debug JAVA import java.util.ArrayList;public class ArrayList {public static ArrayList<Integer> reverse(ArrayList<Integer> list) {for (int i = 0; i < list.size(); i++) {System.out.println(list);}public static ArrayList<Integer> getReverse(ArrayList<Integer> list){for (int index = 0; index < list.size() / 2; index++) {int temp = list.get(index);list.set(index, list.get(list.size() - index - 1));//swaplist.set(list.size() - index - 1, temp); //swap}return list;}}public static void main(String[] args) {ArrayList<Integer> list = new ArrayList<>();list.add(1);list.add(2);list.add(3);System.out.println("Original elements : " + list);System.out.println("Reversed elements : " + getReverse(list));}}

In a graph, two vertices are connected if there is a path between them. If all vertices are connected, we say the graph is connected. Given the Graph ADT below: class Graph { public: void addEdge (int vl, int v2); void delEdge (int vl, int v2); bool hasEdge (int v1, int v2) const; VList adj (int v) const; int v() const; int e() const; } ; Fill in the function isConnected that tells whether graph g is connected or not. Note that you can only use the above methods for g. You may assume vertex ID starts from 0 and define other helper functions if necessary. bool isConnected (const Graph &g) { // Copy this function in the answer and add code below this line. For the toolbar, press ALT+F10 (PC) or ALT+FN+F10 (Mac).

public class HeapPriQ<T> implements PriQueueInterface<T>{ protected ArrayList<T> elements; // priority queue elements protected int lastIndex; // index of last element in priority queue protected int maxIndex; // index of last position in ArrayList protected Comparator<T> comp; public HeapPriQ(int maxSize) // Precondition: T implements Comparable { elements = new ArrayList<T>(maxSize); lastIndex = -1; maxIndex = maxSize - 1; comp = new Comparator<T>() { public int compare(T element1, T element2) { return ((Comparable)element1).compareTo(element2); } }; } public HeapPriQ(int maxSize, Comparator<T> comp) // Precondition: T implements Comparable { elements = new ArrayList<T>(maxSize); lastIndex = -1; maxIndex = maxSize - 1; this.comp = comp; } public boolean isEmpty() // Returns true if this priority queue is empty; otherwise, returns false. {...

Using the graph in the question: Write Java code to create an Adjacency Matrix M to represent the graph. Write Java code to create an Adjacency List L to represent the graph.

implement changeArrayLength(int m) – void method; public class Course { public String code; public int capacity; public SLinkedList<Student>[] studentTable; public int size; public SLinkedList<Student> waitlist; public Course(String code) { this.code = code; this.studentTable = new SLinkedList[10]; this.size = 0; this.waitlist = new SLinkedList<Student>(); this.capacity = 10; } public Course(String code, int capacity) { this.code = code; this.studentTable = new SLinkedList[capacity]; this.size = 0; this.waitlist = new SLinkedList<>(); this.capacity = capacity; } public void changeArrayLength(int m) { // insert your solution here } This method creates a new student table for this course; this new table has the given length m; the method moves all registered students to this table, as described in more detail below. Note that this method itself...

Exercise 2: Consider the following class: public class Sequence { private ArrayList values; public Sequence() { values = new ArrayList(); } public void add(int n) { values.add(n); } public String toString() { return values.toString(); } } Add a method public Sequence merge(Sequence other) that merges two sequences, alternating ele- ments from both sequences. If one sequence is shorter than the other, then alternate as long as you can and then append the remaining elements from the longer sequence. For example, if a is 1 4 9 16 and b is 9 7 4 9 11 then a.merge(b) returns the sequence 1 9 4 7 9 4 16 9 11 without modifying a or b.