Consider the undirected graph shown below. It has 9 vertices as shown. Assume that the vertices lie on the xy-plane. Although the edges are not shown, assume that this is a complete graph Assume further that the weight of each edge is the Euclidean distance between the 2 vertices. (3) If the starting node for the Prim's algorithm for Minimum Spanning Tree is Node 3, then: The first edge to be included is : enter either u,v or v,u.) The second edge to be included is: The third edge to be included is: 9 The fourth edge to be included is: . (Note: For an edge {u,v}, just

Consider the undirected graph shown below. It has 9 vertices as shown. Assume that the vertices lie on the xy-plane. Although the edges are not shown, assume that this is a complete graph Assume further that the weight of each edge is the Euclidean distance between the 2 vertices. (3) If the starting node for the Prim's algorithm for Minimum Spanning Tree is Node 3, then: The first edge to be included is : enter either u,v or v,u.) The second edge to be included is: The third edge to be included is: 9 The fourth edge to be included is: . (Note: For an edge {u,v}, just

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

2. Q1) You are given an undirected connected planar graph. There are 10 vertices and 7 faces in the graph. What is the number of edges in the graph? Note that: A graph is said to be planar if it can be drawn in a plane so that no edge cross. Q2) In how many ways can we pick any number of balls from a pack of three different balls? Q3) The distance between 2 points A and B is 1320Km. Two cars start moving towards each other with 50 Km/hr and 60 Km/hr. After how many hours do they meet?
Draw the Depth First Search Tree of the following graph and Infer the bi-connected components of the graph.
: The adjacency matrix that represents the following graph is 3 1. 4.
Q: Dijkstra's algorithm is an algorithm for finding the shortest paths between nodes in a weighted graph. Given a graph and a source vertex in the graph, find shortest paths from source vertex (E) to all vertices in the graph below.
Specifications: You will create an implementation of this algorithm. Your driver program should provide a graph and a source vertex in the graph. Your implementation should use Dijkstra's Algorithm to determine the shortest path using adjacency matrix representation. Specifically, given a graph and a source vertex in the graph, find the shortest paths from source to all vertices in the given graph, using Dijkstra's Algorithm.
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),…
Course : Algorithm Show two possible solutions for the m-coloring problem to find all possible colorings of the graph below using the three colors red, green, and white.
Objectives - Write a program to calculate minimum spanning tree using Kruskal's algorithm The graph below is from the Minimum Spanning Tree lecture. For vertices, you can use numbers instead of letters. Keep the edge weights the same, the result of your program should be 38. Vertices: A, B, C, D, E, F, G 1, 2, 3, 4, 5, 6, 7 10 6 8 8 10 7. 8 12 Sample Output Finding MST using Kruskal's Algorithm Edges of MST are 1 - 6 = 5 1 - 2 = 6 2 - 7 = 7 3 - 7 = 5 5 - 7 = 7 4 - 5 = 8 Weight of MST is 38
Computer Science: Data Structures and Algorithm (C Programming) A strongly connected component (SCC) of a directed graph G(V,E) is a maximal set of vertices C⊆V suchthatforeverypairofverticesuandvinC,wehavebothu↝vandv↝u;that is, vertices u and v are reachable from each other.In the example graph given below, the sets of nodes a, b, e, c, d, f, g, and h each form a strongly connected component. Thus, the graph consists of 4 strongly connected components. (a) Breadth First Search (BFS) can be used in determining whether each node in a given directed graph is reachable by every other node. Give the pseudocode of an algorithm using BFS that determines whether a given directed graph is a single SCC. Also provide the explanation of your algorithm in plain English along with a runtime analysis. (b) Depth First Search (DFS) can be used to calculate strongly connected compo- nents in a graph. Give the pseudocode of an algorithm using DFS that calculates SCCs in a given directed graph. Also…
Dynamic Programming - Finding the Best Delivery Route Problem: Assume that you work for a pizza bakery as a delivery boy/girl. You are responsible for delivering pizzas prepared based on online orders. You collect orders once an hour, then start delivering. You would like to determine the route where you deliver all pizzas in minimum time. You can illustrate this problem as follows: The bakery and customers are vertices and all of them are connected (there is no pair of vertices that are not connected with an edge. The weight of edges is the time that you need to take to travel between vertices. The edges are two-way (your graph is undirected). Please solve this problem using the DP technique. Show five steps of DP.
7. Consider the following graph: A 14 CO D 9 E C 12 10 17 b) What is the weight of the minimum spanning tree? B Apply Kruskal's algorithm to find the minimum spanning tree. Edges are sorted first by length, and in the event of a tie, by name, where the two letters are in alphabetical order. Use makeset (x), find (x), and union (x, y) to determine if there are cycles. a) Circle the edges that are part of the minimum spanning tree. AC, AD, AE, BC, BD, BE, DE c) Draw the tree that results from applying the union-find algorithm for cycle detection. When drawing the tree, put vertices with lower letters in the left subtrees so that all the vertices in a level are sorted alphabetically from left to right
3. a) How can you store the following graph in a computer memory? 5 3 1 3 3 0 2 -2 12 4 7 2 b) Determine the shortest path from vertex '0' to vertex '2' of the above-mentioned graph. c) Illustrate 'Depth First Search' for the above-mentioned graph.