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 verter d. Verter c is below and to the right of verter e. Verter a is above verter e and to the right of verter c. Verter b is below and to the right of verter a, but above verter c. The edges between the vertices and their weight are as follows: d and f, 1; d and e, 4; ƒ and e, 2; e and a, 2; f and a, 3; e and e, 5; c and a, 7; e and b, 5; and a and b, 6. (a) 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.

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 verter d. Verter c is below and to the right of verter e. Verter a is above verter e and to the right of verter c. Verter b is below and to the right of verter a, but above verter c. The edges between the vertices and their weight are as follows: d and f, 1; d and e, 4; ƒ and e, 2; e and a, 2; f and a, 3; e and e, 5; c and a, 7; e and b, 5; and a and b, 6. (a) 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.

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

See similar textbooks

Similar questions

What does it mean for a graph to be connected? Include a diagram to illustrate
Consider the following graph: a Specify a simple cycle. Use only lower case letters. If the graph has any cycles which are not simple and which have no repeated edges, specify one. If there are none enter none Use only lower case letters.
Create the Directed Acyclic Graph (DAG) from below statement: X = (A+B+C)/(A-B)*(C+D)*(A-B)-D please solve in 30 minutes max thank u
One can model a maze by having a vertex for a starting point, a finishing point, dead ends, and all the points in the maze where more than one path can be taken, and then connecting the vertices according to the paths in the maze. a. Construct such a graph for the following maze. 鷗 b. Which traversal DFS or BFS- would you use if you found yourself in a maze and why?
A simple directed graph with vertices A,B,C,D,E,F,G has adjacency matrix
Given the following graph find all articulation points. If necessary, consider nodes and edges in alphabetical order. H. Display all articulation points alphabetically. Please, report only the list of vertices separated by a single space. No other symbols must be included in the response. This is an example of the response format: ABC etc. Computer Science Please not Calculus
Vertices should be named by the letters in the alphabeth : A, B, C, D, EEdges should be named : e1,e2, e3, e4, e5, e6, e7, e8, e9 Draw or Make a Directed graph with 9 edges and 5 vertices
M2
You are given a graph with five vertices (1,2,3,4,5). You are also told that the DFS sequence is 123245421 Which of the following are NOT possible edges to be left out of the DFS (2,5) (3,4) (1,4) (3,5)
3. For the questions, first construct a directed graph using the resulting number as follows: consider each consecutive two numbers as an edge in the graph 1-4-1-1– 4 → 9→ 2→ 8→ 3→9→ 6→ 8→ 2→ 5→9→ 9 remove the reflexive edges (having same starting and ending nodes) from the graph 1-4–1-4–→ 9→ 2→ 8→ 3 → 9 → 6 → 8→ 2 → 5– 9 Note that for the duplicate edges, your consider only one of them for the graph. For the duplicate 1-4-1-4 → …, we used only one of them in the graph. a) Show the adjacency list of your graph. b) Apply breadth-first search (BFS) algorithm to your graph using any vertex as the source vertex. For the answer, just draw the BFS tree that you obtain after the algorithm terminates c) Apply depth-first search (DFS) algorithm to your graph using any vertex as the source vertex. For the answer, just draw the DFS tree that you obtain after the algorithm terminates