Introduction to Java Programming and Data Structures: Brief Version (11th Global Edition)
11th Edition
ISBN: 9780134671710
Author: Y. Daniel Liang
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Concept explainers
Expert Solution & Answer
Chapter 28.4, Problem 28.4.4CP
Explanation of Solution
Return statement for “getIndex(v)” method if “v” is not in the graph:
The method returns the value “-1” because, the value of “v” is not in the graph.
Explanation:
The method “getIndex()” is to return the index for specified vertex. If the appropriate vertex not in graph then it returns “-1”.
Outcome of “getVertex(index)” method if “index” is not in the graph:
The method returns run time error “IndexOutBoundsException” because the appropriate index value is not available in the graph.
Explanation:
The method “getVertex()” is to return the vertex object for the specified vertex index. If the index not in the graph it throws run time error.
Outcome of “addVertex(v)” method if “v” is already in the graph:
The method returns the Boolean value “false” because the vertex is already added into the graph...
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
DJ and Mark are very lazy guys. These are not the guys from some game, these
are the ones playing games all the time. Recently, they bought a new game
named "Graph Vertices chooser".
The rules of this game are pretty simple. It's a two-player game with each player
taking alternating turns starting with DJ. You are given a weighed graph. All
the vertices are initially unmarked. In each turn, a player chooses an unmarked
vertex and mark it to red or black colour (DJ marks red whereas Mark marks
black). The game ends when there is no any unmarked vertex left. After the end
of the game, DJ's score will be weight of all the edges in graph such that both the
end points of the edge are coloured red. Similarly, score of Mark is sum of weight
of edges with both end points being black.
DJ would like to maximize difference between his and Mark points, while Mark
would like to minimize the difference between DJ's and his score. Both players
optimally.
Now, you are the one who decided to be the…
1-Let’s say you have a variable with a static graph associated with it in the backend that will be executed every time you call .compute on that variable. Is there any way to avoid re-computation of the graph every time you call the .compute method? Consider that you have a significant amount of storage available in this case.
Given the graph class using the adjacency matrix representation,Implement the DFS algorithm (as discussed in the lecture slide) ongraph using the adjacency matrix representation. You have to use thegraph code as a starting point, and add the DFS method in the graphclass similar to the BFS method already present in the Graph class.
Chapter 28 Solutions
Introduction to Java Programming and Data Structures: Brief Version (11th Global Edition)
Ch. 28.2 - What is the famous Seven Bridges of Knigsberg...Ch. 28.2 - Prob. 28.2.2CPCh. 28.2 - Prob. 28.2.3CPCh. 28.2 - Prob. 28.2.4CPCh. 28.3 - Prob. 28.3.1CPCh. 28.3 - Prob. 28.3.2CPCh. 28.4 - Prob. 28.4.1CPCh. 28.4 - Prob. 28.4.2CPCh. 28.4 - Show the output of the following code: public...Ch. 28.4 - Prob. 28.4.4CP
Ch. 28.5 - Prob. 28.5.2CPCh. 28.6 - Prob. 28.6.1CPCh. 28.6 - Prob. 28.6.2CPCh. 28.7 - Prob. 28.7.1CPCh. 28.7 - Prob. 28.7.2CPCh. 28.7 - Prob. 28.7.3CPCh. 28.7 - Prob. 28.7.4CPCh. 28.7 - Prob. 28.7.5CPCh. 28.8 - Prob. 28.8.1CPCh. 28.8 - When you click the mouse inside a circle, does the...Ch. 28.8 - Prob. 28.8.3CPCh. 28.9 - Prob. 28.9.1CPCh. 28.9 - Prob. 28.9.2CPCh. 28.9 - Prob. 28.9.3CPCh. 28.9 - Prob. 28.9.4CPCh. 28.10 - Prob. 28.10.1CPCh. 28.10 - Prob. 28.10.2CPCh. 28.10 - Prob. 28.10.3CPCh. 28.10 - If lines 26 and 27 are swapped in Listing 28.13,...Ch. 28 - Prob. 28.1PECh. 28 - (Create a file for a graph) Modify Listing 28.2,...Ch. 28 - Prob. 28.3PECh. 28 - Prob. 28.4PECh. 28 - (Detect cycles) Define a new class named...Ch. 28 - Prob. 28.7PECh. 28 - Prob. 28.8PECh. 28 - Prob. 28.9PECh. 28 - Prob. 28.10PECh. 28 - (Revise Listing 28.14, NineTail.java) The program...Ch. 28 - (Variation of the nine tails problem) In the nine...Ch. 28 - (4 4 16 tails problem) Listing 28.14,...Ch. 28 - (4 4 16 tails analysis) The nine tails problem in...Ch. 28 - (4 4 16 tails GUI) Rewrite Programming Exercise...Ch. 28 - Prob. 28.16PECh. 28 - Prob. 28.17PECh. 28 - Prob. 28.19PECh. 28 - (Display a graph) Write a program that reads a...Ch. 28 - Prob. 28.21PECh. 28 - Prob. 28.22PECh. 28 - (Connected rectangles) Listing 28.10,...Ch. 28 - Prob. 28.24PECh. 28 - (Implement remove(V v)) Modify Listing 28.4,...Ch. 28 - (Implement remove(int u, int v)) Modify Listing...
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Similar questions
- Create a copy constructor for Graph that takes as input a graph G and creates and initializes a new copy of the graph. Any changes a client makes to G should not affect the newly created graph.arrow_forwardIn this task you will work with an undirected Graph G = {V, E}, where V = {f,p,s,b,l,j,t,c,d} and E = {(1,2), (1,3), (3,8), (4,8), (8,9), (1,7), (2,6), (2,3), (5,6), (6,7), (7,9), (8,1)}. Assume that the nodes are stored in an indexed linear structure (e.g., an array or a vector) numbered consecutively from 1 (node f) to 9 (node d). Run, by hand, a depth-first search (DFS) traversal of the graph G, starting at node p. When choosing which node to visit next amongst the possibilities, choose the one that is next in alphabetical order. Give your answer by listing the edges in the order that DFS will select.arrow_forward2. Use the following description of an undirected graph and draw the graph: v(Graph1) = { A, B, C, D} E(Graph1) = { (A,B), (A,D), (B,C), (B,D) }arrow_forward
- 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).arrow_forwardPeople is represented in the Graph by Nodes or Vertices (the vertex should consist of name of the person) Relationships is represented in the Graph by edges or arcs The project should have at least two class with following methods : addNode add vertices to graphs(New person in the Graph Net ) removeNode removes vertices to graphs(remove person from the graph Net) addEdge adds connections or paths between vertices in graphs(make new relationship between two persons in the graph ) removeEdge removes connection or paths between vertices in graphs (remove the relationship between two persons in the graph ) contains check if a graph contains a certain value hasEdge checks if a connection or path exists between any two vertices in a graph The output has to display a menu of choices. Then the user can select which operation want to perform. Also, you can use the method System.exit(0); to exit the program. The menu of choices will be: Add person into the social…arrow_forwardUsing Matplotlib (based on python), write a code that takes the input of two different functions. The first function should be displayed first on a graph. Program such that the graph gradually transforms into the second function.arrow_forward
- Suppose you have a graph with N vertices. What is the largest number of edges it may have? log N What is the smallest number of edges it may have? N Suppose the graph is represented with an adjacency list. Call the number of edges M. What is the best description of the size of the graph (amount of memory required to store it)? O(N+M) + Suppose the graph is represented with an adjacency matrix. Call the number of edges M. What is the best description of the size of the graph (amount of memory required to store it)? O(N*M) + xarrow_forwardWhy is it better to use an adjacency matrix to represent a graph rather than an adjacency list?arrow_forwardThe adjacency lists in a graph are represented by linked lists. Share a case in point. There's no need to learn how to code.arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill Education
Starting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSON
Digital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSON
Database Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage Learning
Programmable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education