Computer Networking: A Top-Down Approach (7th Edition)
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN: 9780133594140
Author: James Kurose, Keith Ross
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Bartleby Related Questions Icon
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();
}
Transcribed Image Text:2) Implement the transpose() method.
You could find the Main.java in the TransposeGraph folder of your downloaded and unzipped package
login https://repl.it/ and the three dots button in the file panel. Click the upload button
upload the incomplete Main.java to https://repl.it/
- fill missing codes in the method, transpose()
- run and test
Transcribed Image Text:Transpose of a directed graph G is another directed graph on the same collection of vertices with all of the edges
reversed compared to the directions of the corresponding edges in G. That is, if G contains an edge (u, v) then the
converse/transpose/reverse of G contains an edge (v, u) and vice versa.
Given a graph , we need to find another graph which is the transpose of the given graph.
Let us use the follow graphs as an example:
M-M
i)
ii)
----Transpose--->
4
Input: Figure i is the input graph
Output: Figure ii is the transpose graph of the input graph.
Let us assume that the original graph is represented as in an adjacent list.
Adjacency List of the input graph (i):
0: 1, 2, 5
1: 2, 3
2:-
3: 0, 2
4: 2,6
5: 0, 2
Expert Solution
Check MarkThis question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
bartleby
This is a popular solution
bartleby
Trending nowThis is a popular solution!
bartleby
Step by stepSolved in 2 steps
Knowledge Booster
Background pattern image
Similar questions
- Create a ToArray function for the LinkedList class that returns an array from a linked list instance.arrow_forwardpackage edu.umsl.iterator;import java.util.ArrayList;import java.util.Arrays;import java.util.Collection;import java.util.Iterator;public class Main {public static void main(String[] args) {String[] cities = {"New York", "Atlanta", "Dallas", "Madison"};Collection<String> stringCollection = new ArrayList<>(Arrays.asList(cities));Iterator<String> iterator = stringCollection.iterator();while (iterator.hasNext()) {System.out.println(/* Fill in here */);}}} Rewrite the while loop to print out the collection using an iterator. Group of answer choices iterator.toString() iterator.getClass(java.lang.String) iterator.remove() iterator.next()arrow_forwardJava Question 20:arrow_forward
- import java.util.HashSet; import java.util.Set; // Define a class named LinearSearchSet public class LinearSearchSet { // Define a method named linearSearch that takes in a Set and an integer target // as parameters public static boolean linearSearch(Set<Integer> set, int target) { // Iterate over all elements in the Set for () { // Check if the current value is equal to the target if () { // If so, return true } } // If the target was not found, return false } // Define the main method public static void main(String[] args) { // Create a HashSet of integers and populate integer values Set<Integer> numbers = new HashSet<>(); // Define the target to search for numbers.add(3); numbers.add(6); numbers.add(2); numbers.add(9); numbers.add(11); // Call the linearSearch method with the set...arrow_forwardimport java.util.*;public class MyLinkedListQueue{ class Node { public Object data; public Node next; private Node first; public MyLinkedListQueue() { first = null; } public Object peek() { if(first==null) { throw new NoSuchElementException(); } return first.data; } public void enqueue(Object element) { Node newNode = new newNode(); newNode.data = element; newNode.next = first; first = newNode; } public boolean isEmpty() { return(first==null); } public int size() { int count = 0; Node p = first; while(p ==! null) { count++; p = p.next; } return count; } } } Hello, I am getting an error message when I execute this program. This is what I get: MyLinkedListQueue.java:11: error: invalid method declaration; return type required public MyLinkedListQueue() ^1 error I also need to have a dequeue method in my program. It is very similar to the enqueue method. I'll...arrow_forwardPLEASE HELP, PYTHON THANK YOU class Graph(object): def __init__(self, graph_dict=None): ################# # Problem 1: # Check to see if the graph_dict is none # if so, create an empty dictionary and store it in graph_dict ################## #DELETE AND PUT IN THE IF AND ASSIGNMENT STATEMENTS self.__graph_dict = graph_dict ################# # Problem 2: # Create a method called vertices and pass in self as the parameter ################## #DELETE AND PUT IN THE METHOD DEFINITION """ returns the vertices of a graph """ return list(self.__graph_dict.keys()) def edges(self): """ returns the edges of a graph """ ################# # Problem 3: # Return the results of the __generate_edges ################## #DELETE AND PUT IN THE RETURN STATEMENTSarrow_forward
- Java related to linked list finding max see image belowarrow_forwardPLEASE 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...arrow_forwardBoth ArrayList and LinkedList are inefficient for searches, take linear time. Explain why this occurs in these data structuresarrow_forward
- Python Graph Algorithms: Minimum Spanning Trees Suppose you are an engineer working on designing a road network for a new town. The town has many residential areas and commercial centers that need to be connected efficiently. You decided to represent the town as a connected, undirected graph where each vertex represents a location, and each edge represents a road connecting two locations. The weight of each edge represents the distance between the two locations. To ensure the road network is efficient, you need to find the minimum spanning tree of the graph. However, due to budget constraints, you can only construct roads with a maximum distance limit. You need to determine for how many pairs of locations, the minimum spanning tree of the graph remains the same when the maximum distance limit of a road is increased by 2 units. To solve this, you write a program that takes as input the number of locations, the number of roads, and the weight of each road. Your program will also receive...arrow_forwardin C language implement a graph coloring method that assigns the minimum color to each vertex so it does conflict with vertices that have been colored (using adjacency list)arrow_forward
arrow_back_ios
arrow_forward_ios
Recommended textbooks for you
- Text book imageComputer Networking: A Top-Down Approach (7th Edi...Computer EngineeringISBN:9780133594140Author:James Kurose, Keith RossPublisher:PEARSONText book imageComputer Organization and Design MIPS Edition, Fi...Computer EngineeringISBN:9780124077263Author:David A. Patterson, John L. HennessyPublisher:Elsevier ScienceText book imageNetwork+ Guide to Networks (MindTap Course List)Computer EngineeringISBN:9781337569330Author:Jill West, Tamara Dean, Jean AndrewsPublisher:Cengage Learning
- Text book imageConcepts of Database ManagementComputer EngineeringISBN:9781337093422Author:Joy L. Starks, Philip J. Pratt, Mary Z. LastPublisher:Cengage LearningText book imagePrelude to ProgrammingComputer EngineeringISBN:9780133750423Author:VENIT, StewartPublisher:Pearson EducationText book imageSc Business Data Communications and Networking, T...Computer EngineeringISBN:9781119368830Author:FITZGERALDPublisher:WILEY
Text book image
Computer Networking: A Top-Down Approach (7th Edi...
Computer Engineering
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:PEARSON
Text book image
Computer Organization and Design MIPS Edition, Fi...
Computer Engineering
ISBN:9780124077263
Author:David A. Patterson, John L. Hennessy
Publisher:Elsevier Science
Text book image
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:9781337569330
Author:Jill West, Tamara Dean, Jean Andrews
Publisher:Cengage Learning
Text book image
Concepts of Database Management
Computer Engineering
ISBN:9781337093422
Author:Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:Cengage Learning
Text book image
Prelude to Programming
Computer Engineering
ISBN:9780133750423
Author:VENIT, Stewart
Publisher:Pearson Education
Text book image
Sc Business Data Communications and Networking, T...
Computer Engineering
ISBN:9781119368830
Author:FITZGERALD
Publisher:WILEY