Question: 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.
