TranposeGraph import java.io.; import java.util.; // This class represents a directed graph using adjacency list // representation class ALGraph{ private int vertices; // No. of vertices // Array of lists for Adjacency List Representation private LinkedList adj[]; // Constructor ALGraph(int vertices) { this.vertices = vertices; adj = new LinkedList[this.vertices]; for (int i=0; i getAdjacentList(int v) { return adj[v]; } //Function to add an edge into the graph void addEdge(int v, int w) { adj[v].add(w); // Add w to v's list. } // TODO Transpose graph // If the graph includes zero vertices, return null // Create a new ALGraph // For every vertex, retrieve its adjacent list, make a pass over the list and rewrite each edge (u, v) to be (v, u) and add the u into the adjacent list of v public ALGraph transpose(){ } public void displayGraph() { for (int count = 0; count < this.vertices; count++) { System.out.print(count + ": "); int i = 0; for (Integer adjVertice: this.getAdjacentList(count)) { System.out.print(adjVertice.intValue() + (i < this.getAdjacentList(count).size() - 1 ? ", " : " ")); i++; } System.out.println(); } } } public class Main { public static void main(String args[]) { ALGraph g = new ALGraph(7); g.addEdge(0, 1); g.addEdge(0, 2); g.addEdge(0, 5); g.addEdge(1, 2); g.addEdge(1, 3); g.addEdge(3, 0); g.addEdge(3, 2); g.addEdge(4, 2); g.addEdge(4, 6); g.addEdge(5, 0); g.addEdge(5, 2); g.addEdge(6, 3); g.addEdge(6, 4); System.out.println("Before the transposing, we have a graph: "); g.displayGraph(); System.out.println("After the transposing, we have a graph: "); g.transpose().displayGraph(); }

Computer Networking: A Top-Down Approach (7th Edition)

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

See similar textbooks

Related questions

Question

TranposeGraph import java.io.*; import java.util.*; // This class represents a directed graph using adjacency list // representation class ALGraph{ private int vertices; // No. of vertices // Array of lists for Adjacency List Representation private LinkedList adj[]; // Constructor ALGraph(int vertices) { this.vertices = vertices; adj = new LinkedList[this.vertices]; for (int i=0; i getAdjacentList(int v) { return adj[v]; } //Function to add an edge into the graph void addEdge(int v, int w) { adj[v].add(w); // Add w to v's list. } // TODO Transpose graph // If the graph includes zero vertices, return null // Create a new ALGraph // For every vertex, retrieve its adjacent list, make a pass over the list and rewrite each edge (u, v) to be (v, u) and add the u into the adjacent list of v public ALGraph transpose(){ } public void displayGraph() { for (int count = 0; count < this.vertices; count++) { System.out.print(count + ": "); int i = 0; for (Integer adjVertice: this.getAdjacentList(count)) { System.out.print(adjVertice.intValue() + (i < this.getAdjacentList(count).size() - 1 ? ", " : " ")); i++; } System.out.println(); } } } public class Main { public static void main(String args[]) { ALGraph g = new ALGraph(7); g.addEdge(0, 1); g.addEdge(0, 2); g.addEdge(0, 5); g.addEdge(1, 2); g.addEdge(1, 3); g.addEdge(3, 0); g.addEdge(3, 2); g.addEdge(4, 2); g.addEdge(4, 6); g.addEdge(5, 0); g.addEdge(5, 2); g.addEdge(6, 3); g.addEdge(6, 4); System.out.println("Before the transposing, we have a graph: "); g.displayGraph(); System.out.println("After the transposing, we have a graph: "); g.transpose().displayGraph(); }