An undirected weighted graph G is given below: 12 2 6 Figure 16: An undirected weighted graph has 6 vertices, a through , and 9 edges. Verter d is on the left. Verter f is above and to the right of verter d. Verter e is below and to the right of verter f, but above vertez d. Verter e is belou and to the right of vertez e. Vertez a is above verter e and to the right of verter c. Verter b is below and to the right of vertez a, but above vertez e. The edges between the vertices and their weight are as follows: d and f. 1; d and e, 4: f and e, 2; e and a, 2: f and a, 3; e and c, 5; e and a, 7; e and b, 5; and a and b, 6. Use Prim's algorithm to compute the minimum spanning tree for the weighted graph. Start the algorithm at vertex a. Show the order in which the edges are added to the tree. What is the minimum weight spanning tree for the weighted graph in the previous question subject to the condition that edge {d, e} is in the span- ning tree? How would you generalize this idea? Suppose you are given a graph G and a particular edge {u, v} in the graph. How would you alter Prim's algorithm to find the minimum spanning tree subject to the condition that {u, v} is in the tree?
An undirected weighted graph G is given below: 12 2 6 Figure 16: An undirected weighted graph has 6 vertices, a through , and 9 edges. Verter d is on the left. Verter f is above and to the right of verter d. Verter e is below and to the right of verter f, but above vertez d. Verter e is belou and to the right of vertez e. Vertez a is above verter e and to the right of verter c. Verter b is below and to the right of vertez a, but above vertez e. The edges between the vertices and their weight are as follows: d and f. 1; d and e, 4: f and e, 2; e and a, 2: f and a, 3; e and c, 5; e and a, 7; e and b, 5; and a and b, 6. Use Prim's algorithm to compute the minimum spanning tree for the weighted graph. Start the algorithm at vertex a. Show the order in which the edges are added to the tree. What is the minimum weight spanning tree for the weighted graph in the previous question subject to the condition that edge {d, e} is in the span- ning tree? How would you generalize this idea? Suppose you are given a graph G and a particular edge {u, v} in the graph. How would you alter Prim's algorithm to find the minimum spanning tree subject to the condition that {u, v} is in the tree?
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
Related questions
Question
Transcribed Image Text:An undirected weighted graph G is given below:
3
.2
5
Figure 16: An undirected weighted graph has 6 vertices, a through f, and 9 edges.
Verter d is on the left. Verter f is above and to the right of verter d. Verter e is
below and to the right of verter f, but above vertez d. Verter e is belou and to the
right of vertez e. Vertez a is above verter e and to the right of verter c. Verter
6 is below and to the right of vertez a, but above vertez e. The edges between the
vertices and their weight are as follous: d and f, 1; d and e, 4: f and e, 2; e and a,
2: f and a, 3; e and c, 5; e and a, 7; e and b, 5; and a and b, 6.
Use Prim's algorithm to compute the minimum spanning tree for the weighted
graph. Start the algorithm at vertex a. Show the order in which the edges
are added to the tree.
What is the minimum weight spanning tree for the weighted graph in the
previous question subject to the condition that edge {d, e} is in the span-
ning tree?
How would you generalize this idea? Suppose you are given a graph G
and a particular edge {u, v} in the graph. How would you alter Prim's
algorithm to find the minimum spanning tree subject to the condition that
{u, v} is in the tree?
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 4 steps with 3 images
