Week 8

Question

First Response to a Classmate: Review a classmate’s real-world situation, graph, and spanning tree.

1) Draw another spanning tree for their initial graph that has not been drawn by any classmate. (Remember that one can always find a spanning tree from a connected graph and there are often many different spanning trees that can be found from a single connected graph. Answers will vary.)

2) What is the total cost of this spanning tree?

Class Mate Post

Class Mate Response

Question

Second Response to a Classmate: In your own words, describe what the Kruskals’ Algorithm is and its steps. In the context of your classmate’s situation, what would the Kruskal’s algorithm do? Can you apply the Kruskals’ algorithm to your classmate’s graph? What is the result?

Class Mate Post

Class Mate Response