8 \underline{Label each step} a) Find a MST using Prim's Algorithm starting at node B A 7 C 8 B 5 5 9 7 15 E D 8 9 6 F 11 G b) Find a MST using Kruskal's Algorithm A 7 C 8 B 5 5 9 7 15 E D 8 9 6 F 11 G
Added by Amy T.
Close
Step 1
Step 1: Find a MST using Prim's Algorithm starting at node B. Show more…
Show all steps
Your feedback will help us improve your experience
Shu-Ting Huang and 81 other AP CS educators are ready to help you.
Ask a new question
Labs
Want to see this concept in action?
Explore this concept interactively to see how it behaves as you change inputs.
Key Concepts
Recommended Videos
Apply Kruskal's Algorithm to the following graph to determine a Minimum Spanning Tree. Kruskal's algorithm is an edge oriented algorithm. SHOW YOUR WORK AS YOU APPLY KRUSKAL'S ALGORITHM. THAT IS, LIST THE EDGES IN THE ORDER THAT THEY ARE ADDED TO THE TREE. WHAT IS THE COST OF THE MINIMAL SPANNING TREE? INDICATE BELOW (DRAW) THE RESULTING MINIMAL SPANNING TREE. TRACE: List below the edges of the graph in the order in which they were added to the MST In the space below, draw the resulting MST -OR- Clearly indicate the MST in the graph above
Shu-Ting H.
5. Consider the graph below. a) Find a minimum spanning tree of the graph using Kruskal's algorithm. List the edges in the order they are put into the tree. b) Apply Prim's algorithm to the same graph starting with node A. List the edges, in order added to the MST. c) Suppose the cost of every edge touching node A is increased by a constant. Are we guaranteed that the MST remains the MST? Explain. 6. Give the adjacency matrix for the graph used in Problem 5.
Adi S.
(b) Illustrate the execution of Kruskal's algorithm on the graph below. Show the disjoint sets after each edge is added to the tree and show the final MST. 3 1 a b 3 2 4 1 d 2 3 3 1 2 g h
Akash M.
Recommended Textbooks
Computer Science and Information Technology
Introduction to Programming Using Python
Computer Science - An Overview
Transcript
Watch the video solution with this free unlock.
EMAIL
PASSWORD