In the computer network in the accompanying figure, the same message is to be broadcast
Chapter 7, Problem 29(choose chapter or problem)
In the computer network in the accompanying figure, the same message is to be broadcast from node C to nodes A, E, F, and G. One way to do this is to find the shortest path from C to each of these nodes and send out multiple copies of the same message. A more efficient approach is to send one copy out from C along a spanning tree for the subgraph containing the nodes involved. Use the depth-first search algorithm to find a spanning tree for the subgraph.
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer