Spanning Trees Exercises

   < Previous  Next >
  1. For each of the following trees, calculate a DFS spanning tree and a BFS spanning tree (starting at A):
  2. Interpret the vertices below as cities and the edges as the cost to lay down fiber optic cable.
    What is the least cost to connect every city (starting with city A) for each graph?
    Draw all of the edges that are part of the solution.

Last Modified: