Problem 3 1) Consider that you have a graph with 8 vertices numbered A to H, and the following edges: (A, B), (A, C), (B, C), (B, D), (C, D), (C, E), (D, E), (D, F), (E, G), (F, G), (F, H), (G, H) a) Using depth-first search algorithm, what would be the sequence of visited nodes starting at A (show the content of the stack at some steps). b) Same question if the algorithm used in breadth first search. c) What would be the minimum spanning tree rooted at A if a Depth First Search algorithm is used (refer to question a), show few steps in running the algorithm. d) What would be the minimum spanning tree if a Breadth First Search algorithm is used (refer to question b), show few steps of the algorithm.

Problem 3 1) Consider that you have a graph with 8 vertices numbered A to H, and the following edges: (A, B), (A, C), (B, C), (B, D), (C, D), (C, E), (D, E), (D, F), (E, G), (F, G), (F, H), (G, H) a) Using depth-first search algorithm, what would be the sequence of visited nodes starting at A (show the content of the stack at some steps). b) Same question if the algorithm used in breadth first search. c) What would be the minimum spanning tree rooted at A if a Depth First Search algorithm is used (refer to question a), show few steps in running the algorithm. d) What would be the minimum spanning tree if a Breadth First Search algorithm is used (refer to question b), show few steps of the algorithm.

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

Problem 3: Find the points on a circle of its octants with the circle centered at(5,5)and has a radius of 8 units. (with the aid of the table shows the result) Problem 4: Translate the triangleABChas vertices[A(−8,6),B(−8,9),C(−4,6)]+9units in thex-direction and−4in they-direction. (with the aid of the graph, show the result) Problem 5: Determine the coordinate of the vertices of triangleABC[A(−8,7),B(−3,7),C(−4,3)]after a counterclockwise rotation of180∘around the origin. (with the aid of the graph, show the result)
question 5. Draw an Eulerian graph and a Hamiltonian graph, both of more than four vertices.
3. Draw an undirected graph with 6 vertices that has an Eulerian Cycle and a Hamiltonian Cycle. The degree of each vertex must be greater than 2. List the degrees of the vertices, draw the Hamiltonian Cycle on the graph and give the vertex list of the Eulerian Cycle.
Please solve with the computer Question 2: Draw a simple undirected graph G that has 11 vertices, 7 edges.
The following is a graph theory problem: Suppose we have a graph A = (X, Y) and a subgraph of A, which is expressed as B = (x, y). x is an element of X and y is an element of Y. A subgraph is plainly described as a graph obtained from A by removing vertices &/or edges. For every following statement determine whether it is true or false. Explain or provide counterexample. Be careful when answering the following questions to leave edges that have their endpoints in B. (i) If A is connected then B is connected (and vice versa: If B... then A) (ii) If A is simple graph then B is simple graph (and vice versa: If B... then A) (iii) If A contains a cycle then B contains a cycle (and vice versa: If B... then A) (iv) If A is a tree then B is a tree (and vice versa: If B... then A)
5. Draw a Bipartite Graph with 10 vertices that has an Eulerian Path and a Hamiltonian Cycle. The degree of each vertex must be greater than 2. List the degrees of the vertices, draw the Hamiltonian Cycle on the graph and give the vertex list of the Eulerian Path.
Draw a graph G containing the following vertices and edges. V(G) = {0, 1, 2, 3, 4, 5, 6} E(G) = { (0, 1), (0, 2), (0, 3), (2, 1), (2, 4), (5, 1), (5, 3)}
Draw a graph with four vertices of degrees 1, 2, 2, and 7 or else explain whyno such graph exists.
An aircraft company has their flight data as shown in the table below, where a forward flight from A to B will take 4 miles and a return B to A will take 3 miles. A B C D A 4 3 1 B 3 3 C 3 3 3 D 2 5 2 11. With the above information provided, draw a graph for the data provided. Indicate the weights on them. 12. Produce the adjacency matrix for your graph drawn 13. Find the shortest path in your graph and show the vertices and edges SECTION C An artificial intelligence system was design to forecastthe financial trading market and predict change based on observed variables from the business environment. The variables to be observed are i. Population(A) ii. Poverty rate(B) iii. Inflation (C) iv. Available resources(D) Theses variables can affect each other or impact upon one another. Below is a table of the variables with their effect on each other. A B C C A 0.1 0.3 0.3 0.3 B 0.2 0.2 0.2 0.4 C 0.2 0.5 0.1 0.2 D 0.1 0.2 0.2 0.5 14. Draw the Markov chain state…
Computer Science please generate and assign a random biconnected graph with n node and e edges in c++ and show the result on NodeXL
1. Draw an undirected graph using the following set of edges. A={{1,4},{4,6},{6,5},{5,2},{2,1},{3,1},{2,3},{3,5},{6,3},{3,4}} a. What is the degree of each of the nodes in this graph? b. Is this graph regular?
Give an example of a graph (with or without weights on the edges) where the betweenness and closeness centrality points are different. The graph must be composed of at least 5 vertices and at most 8 vertices.