Question

For Esercises 25.28, write the nodes in a breadth first search of the graph for Exercises 21 the node specified 25、 26, g 20. In the computer network in the accompanying figure, the same message is to be broade Dribe ( 21-24 28. e 27. to nodes 4.Е. F and G. One way to do this is to find the shortest path from C to send out multiple copies of the same message. A more etficient approach is to send one along a spanning tree for the subgraph containing the nodes involved. Use the depth-fist CTIO 6 each of to find a spanning tree for the subgraph. 30. Using the graph for Exercise 29, use the breadth-first search algorithm to find a spanning tree for the 31. Use the depth-first search algorithm to do a topological sort on the following graph. Indicate the numbers on the graph. Also state the starting node or nodes for the search. 2. Use the depth-first search algorithm to do a topological sort on the following graph. Indicate the countin numbers on the graph. Also state the starting node or nodes for the search.

discrete 2
question 31

Answer 1

20 C, no do Ato dl