2) [0, 2, 11, 1, 1, 0, 10, 9, 3, 00, 0, 3, 0, 0] 3, 00, 00, 3, 7, a) Draw the above directed graph in the space besides the matrix b) For the graph above, determine the all-pair shortest path distance for all vertices (from all vertices). c) Determine the shortest path between vertices 1 to 3.

2) [0, 2, 11, 1, 1, 0, 10, 9, 3, 00, 0, 3, 0, 0] 3, 00, 00, 3, 7, a) Draw the above directed graph in the space besides the matrix b) For the graph above, determine the all-pair shortest path distance for all vertices (from all vertices). c) Determine the shortest path between vertices 1 to 3.

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

Q2) a) Show that K5 is not planar graph. Use Euler formula. b) A connected planar graph has nine vertices having degrees 2, 2, 2, 3, 3, 3, 4, 4 and 5. How many edges are there? How many faces are there?
(c) Assume you are having a graph in which there are two shortest paths from the source node u to a node v with different number of intermediate vertices. Modify Dijkstra's algorithm in such a way that it always prefers the path with fewest intermediate edges/vertices. What is the complexity of this modified algorithm?
2. (15 pts.) the adjacency matrix of G. Let n be the number of vertices so that the matrix M is n x n matrix. For any matrix A, let us denote the element of i-th row and j-th column of the matrix A by A[i, j]. We are given a graph G = (V, E); G could be a directed graph or undirected graph. Let M be 1. Consider the square of the adjacency matrix M. For all i and j, show that M²[i, j] is the number of different paths of length 2 from the i-th vertex to the j-th vertex. It should be explained or proved as clearly as possible. 2. For any positive integer k, show that Mk[i, j] is the number of different paths vertex to the j-th vertex. You may use induction on k to prove it. length k from the i-th 3. Assume that we are given a positive integer k. Design an algorithm to find the number of different paths of length k from the i-th vertex to j-th vertex for all pairs of (i, j). The time complexity of your algorithm should be O(n³ log k). You can get partial credits if you design an algorithm…
Discrete math: (a) Apply improved Dijkstra’s algorithm to the following graph to find the shortest path from A to every other vertex in the graph. (b) Apply Kruskal’s algorithm to the graph to find a minimum spanning tree.
(a) Let G be a simple undirected graph with 18 vertices and 53 edges such that the degreesof G are only 3 and 7. Suppose there are a vertices of degree 7 and b vertices ofdegree 3. Find a and b. To receive any credit for this problem you must write completesentences, explain all of your work, and not leave out any details. problem 1, continued(b) Recall that a graph G is said to be k-regular if and only if every vertex in G has degreek. Draw all 3-regular simple graphs with 12 edges (mutually non-isomorphic). Hint:there are six of them. To receive credit for this problem, you should explain, as well aspossible, why all of your graphs are mutually non-isomorphic.
4. Using Floyd's algorithm, compute the distance matrix for the weight directed graph defined by the following matrix: 0 4 -2] 6 2 3 -3 2 0 4 ∞o 5 0 Show the intermediate matrices after each iteration of the outermost loop.
9) How many directed simple cycles does this graph have? 0 4 A) 0 B) 3 (2) 5 C) 9 1 3 6 D) 2 E. 12
(c) Use Kruskal's algorithm to find a minimal spanning tree for the following graph, explaining each step. Draw the minimal spanning tree. Give the total weight of the spanning tree. 3 D B 2 6 4 E 5 4 F с 9 6 3 A
(b) Write down the degree of cach vertex in the following graph. Hence, verify the Handshaking Theorem.
5 10 Consider the graph given above. Use Dijkstra's algorithm to find the shortest path between I and L. a. List the vertices in the order they are visited as specified by the algorithm. b. What is the total weight along the path? 6.
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)
6. Refer to the following given graph: a) 2 1 3 ليا 3 3 5 2 8 Show the adjacency matrix for the graph. 7 2 5 6 b) List the nodes of the graph in ascending order using breadth-first traversal (the origin node is node 1). c) List all possible paths from vertex 5 to vertex 3. Then find the shortest path distance from vertex 5 to vertex 3.