Similar Books

    No books found

Title
Chapter: 28 / Q: 19
(Display a DFS/BFS tree in a graph) Modify GraphView in Listing 28.6 to add a new data field tree with a set method
Chapter: 28 / Q: 20
(Display a graph) Write a program that reads a graph from a file and displays it. The first line in the file contains a number that indicates the number of vertices (n)
Chapter: 28 / Q: 21
(Display sets of connected circles) Modify Listing 28.10, ConnectedCircles.java, to display sets of connected circles in different colors. That is, if two circles are connected, they are displayed using the same color; otherwise, they are not in same color, as shown in Figure 28.25. (Hint: See P
Chapter: 28 / Q: 22
(Move a circle) Modify Listing 28.10, ConnectedCircles.java, to enable the user to drag and move a circle
Chapter: 28 / Q: 23
(Connected rectangles) Listing 28.10, ConnectedCircles.java, allows the user to create circles and determine whether they are connected
Chapter: 28 / Q: 24
Remove a circle) Modify Listing 28.10, ConnectedCircles.java, to enable the user to remove a circle when the mouse is clicked inside the circle
Chapter: 29 / Q: 1
Kruskal’s algorithm) The text introduced Prim’s algorithm for finding a minimum spanning tree. Kruskal’s algorithm is another well-known algorithm for finding a minimum spanning tree
Chapter: 29 / Q: 2
(Implement Prim’s algorithm using an adjacency matrix) The text implements Prim’s algorithm using lists for adjacent edges. Implement the algorithm using an adjacency matrix for weighted graphs
Chapter: 29 / Q: 3
(Implement Dijkstra’s algorithm using an adjacency matrix) The text implements Dijkstra’s algorithm using lists for adjacent edges. Implement the algorith
Chapter: 29 / Q: 4
(Modify weight in the nine tails problem) In the text, we assign the number of the flips as the weight for each move. Assuming that the weight is three times of the number of flips, revise the program
total questions: 772

Questions

772

Views

Best Answers

299

Points

5