PROBLEM 7Consider the following tree. Assume that the neighbors of a vertex are consid-ered in alphabetical order.bFigure 15: A graph has 7 verlices, a through g, and 10 edges. Verter e on the leftend is horizonlally inline wilth verler g on the right end. Verler b is below and lothe right of verter e. Verler e is above verler e and lo the right of verter b. VerlerS is between and lo the right of verlices e and b. Verler S is horizonlally inline wilhverlices e and g. Verler a is above and to the right of verler f. Verler d is belowand lo the right of verler f. Verter a is verlically inline with verler d. Verler g isbetween and lo the right of verlices a and d. The edges belween the verlices are asfollows: e and b; b and c; e and f; c and a; a and d; b and f; f and a; ƒ and d; aand g; and d and g.(a) Give the tree resulting from a traversal of the graph below starting at ver-tex a using BFS.(b) Give the tree resulting from a traversal of the graph below starting at ver-tex a using DFS.

Step 1:- BFS stands for breadth-first search in this traversal we can use the queue to visit every…

Answered: (a) Give the tree resulting from a…

(a) Give the tree resulting from a traversal of the graph below starting at ver- tex a using BFS. (b) Give the tree resulting from a traversal of the graph below starting at ver- tex a using DFS.

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

1. Unreachable Nodes You have been given an undirected graph consisting of N nodes and Medges. The nodes in this graph are enumerated from 1 to N. The graph can consist of self-loops as well as multiple edges. This graph consists of a special node called the head node. You need to consider this and the entry point of this graph. You need to find the number of nodes that are unreachable from this head node. Create a function unreachableNodesCount (N, M, ListofEdges, HeadNode) where N is the number of nodes, M is the number of edges, List0fEdges contains list of edges in the graph and HeadNode is a special node which is the entry point of this graph. The function will return the number of nodes that are unreachable from the head node. Note: You will need to use N, M and List of Edges to first create the graph, as well as a search function to define the unreachable nodes count. >>>N = 10 >>> M = 10 >>> ListofEdges [(8, 1), (8, 3), (7, 4), (7, 5), (2, 6), (10, 7), (2, 8), (10, 9), (2, 10),…
1 A spanning tree for an undirected graph is a sub-graph which includes all vertices but has no cycles. There can be several spanning trees for a graph. A weighted undirected graph can have several spanning trees One of the spanning trees has smallest sum of all the weights associated with the edges. This tree is called minimum spanning tree (MST). Find the MST in the following graph using Kruskal?s Algorithm. V={a, b, c, d, e, f, g, h, i, j} and E={(a, b, 12), (a, b, 3), (a, j, 13), (b, c, 12), (b, d, 2), (b, h, 4), (b, i, 25), (c, d, 7), (c, j, 5), (e, f, 11), (e, j, 9), (f, g, 15), (f, h, 14), (g, h, 6), (h, d, 20), (h, i, 1) }. Note: Numeric value is the weight of the corresponding edge.
algorithm GenericSearch (G, s) pre-cond: G is a (directed or undirected) graph, and s is one of its nodes. post-cond: The output consists of all the nodes u that are reachable by a path in G from s.
PROBLEM 5 Use Prim's algorithm to compute the minimum spanning tree for the weighted graph. Start the algorithm at vertex A. Explain and justify each step as you add an edge to the tree. 2 A 5 E 6 4 7 в D 3 Figure 10: A uweighted graph shows 5 vertices, represented by circles, and 6 edges, represented by line segments. Vertices A, B, C, and D are placed at the corners of a rectangle, whereas verter E is at the center of the rectangle. The edges, A B, B D, A C, C D, A E, and E C, have the weights, 7, 3, 2, 4, 5, and 6, respectively.
algorithm ShortestPath (G, s) pre-cond: G is a (directed or undirected) graph, and s is one of its nodes. post-cond: π specifies a shortest path from s to each node of G, and d specifiestheir lengths.
A complete binary tree is a graph defined through the following recur- sive definition. Basis step: A single vertex is a complete binary tree.Inductive step: If T1 and T2 are disjoint complete binary trees with roots r1, r2, respectively, the the graph formed by starting with a root r, and adding an edge from r to each of the vertices r1,r2 is also a complete binary tree.The set of leaves of a complete binary tree can also be defined recur- sively.Basis step: The root r is a leaf of the complete binary tree with exactly one vertex r.Inductive step: The set of leaves of the tree T built from trees T1, T2 is the union of the sets of leaves of T1 and the set of leaves of T2. The height h(T ) of a binary tree is defined in the class.Use structural induction to show that L(T), the number of leaves of a complete binary tree T , satisfies the following inequality L(T) ≤ 2^h(T).
(a) Give the tree resulting from a traversal of the graph below starting at vertex a using BFS and DFS. Assume that the neighbors of a vertex are considered in alphabetical order. b Figure 15: A graph has 7 vertices, a through g, and 10 edges. Verter e on the left end is horizontally inline with verter g on the right end. Ver- ter b is below and to the right of verter e. Verter c is above vertez e and to the right of verter b. Verter f is between and to the right of vertices e and b. Verter f is horizontally inline with vertices e and g. Vertez a is above and to the right of verter f. Verte d is below and to the right of verter f. Verter a is vertically inline with verter d. Verter g is between and to the right of vertices a and d. The edges between the vertices are as follows: e and b; b and c; c and f; c and a; a and d; b and f; ƒ and a; ƒ and d; a and g; and d and g.
Question 3: Find the Minimum Spanning Tree for the given graph using Prim’s algorithm. Thestarting vertex is “A” and write all the steps.
A complete graph with 6 vertices is traversed using depth first search. The vertices are labeled A through F. The search starts at vertex A and vertices are considered in alphabetical order. What is the resulting DFS tree? B C E FO E FO C E
Run the Kruskal's algorithm from vertex 0 on the following graph. Show a scquencc of diagrams in which the tree gradually grows. 8 15 11
Question 16 Find the list of vertices following the breadth-first traversal of the graph below starting from vertex A. ( Note: when two or more nodes are equally as likely to be selected, select the one that comes fırst alphabetically). Enter your answer as a list of nodes with no space (or any other separator) between them. J D (A E
Sub Problem graph Caltulate the number of edge and verices for a graph? if n=6. Fiblc) Fib(5) fiblu) Fib( 3) Fib(2) Fibla) Fiels) Fibf 3) Fibl0) Fib(s) Fibli) Fl) fibl1) Fibli) Fible) F) Fblo)