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(); }
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...
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();
}
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 2 steps
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY