Discover
Questions library
Collections library
Find online teacher
login
Discover
questions library
Find online teacher
login
Popular searches:
if-else
class-diagram
flowchart
Polymorphism
Home
Questions
Questions
Study lists
Asmaamasry Questions
705 Questions
(Dynamic graphs) Write a program that lets the users create a weighted graph dynamically. The user can create a vertex by entering its name and location, as shown in Figure 29.27
Java programming
2022-07-01
Answers
30
Question
40
Followers
30
0
0
160
(Display a minimum spanning tree) Revise GraphView in Listing 28.6 to display a weighted graph and a minimum spanning tree for the graph in Figure 29.1, as shown in Figure 29.26. The edges in the MST are shown in red
Java programming
2022-07-01
Answers
30
Question
40
Followers
30
0
0
137
(Display shortest paths) Revise GraphView in Listing 28.6 to display a weighted graph and a shortest path between the two specified cities, as shown in Figure 29.19
Java programming
2022-07-01
Answers
30
Question
40
Followers
30
0
0
234
(Display weighted graphs) Revise GraphView in Listing 28.6 to display a weighted graph. Write a program that displays the graph in Figure 29.1 as shown in Figure 29.25. (Instructors may ask students to expand this program by adding new cities with appropriate edges into the graph)
Java programming
2022-07-01
Answers
30
Question
40
Followers
30
0
0
286
(Find shortest paths) Write a program that reads a connected graph from a file. The graph is stored in a file using the same format specified in Programming Exercise 29.9
Java programming
2022-07-01
Answers
30
Question
40
Followers
30
0
0
209
(Create a file for a graph) Modify Listing 29.3, TestWeightedGraph.java, to create a file for representing graph1
Java programming
2022-07-01
Answers
30
Question
40
Followers
30
0
0
209
(Find a minimum spanning tree) Write a program that reads a connected graph from a file and displays its minimum spanning tree
Java programming
2022-07-01
Answers
30
Question
40
Followers
30
0
0
215
(Traveling salesperson problem) The traveling salesperson problem (TSP) is to find a shortest round-trip route that visits each city exactly once and then returns to the starting city
Java programming
2022-07-01
Answers
30
Question
40
Followers
30
0
0
149
(Weighted 4 * 4 16 tails) Revise Listing 29.9, WeightedNineTail.java, for the weighted 4 * 4 16 tails problem
Java programming
2022-07-01
Answers
30
Question
40
Followers
30
0
0
200
(Weighted 4 * 4 16 tails model) The weighted nine tails problem in the text uses a 3 * 3 matrix. Assume that you have 16 coins placed in a 4 * 4 matrix
Java programming
2022-07-01
Answers
30
Question
40
Followers
30
0
0
166
(Prove or disprove) The conjecture is that both NineTailModel and WeightedNineTailModel result in the same shortest path
Java programming
2022-07-01
Answers
30
Question
40
Followers
30
0
0
171
(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
Java programming
2022-07-01
Answers
30
Question
40
Followers
30
0
0
228
(Implement Dijkstra’s algorithm using an adjacency matrix) The text implements Dijkstra’s algorithm using lists for adjacent edges. Implement the algorith
Java programming
2022-07-01
Answers
30
Question
40
Followers
30
0
0
221
Total:
705
Previous
29
30
31
32
33
Next
Go
