The table shows the distances, in units of 100 m, between seven houses, A to G. A в D E F G A 4 5 3 6 B 4 1 4 7 5 1 3 4 6 7 D 3 2 3 2 4 E 4 4 6 F 7 6 10 G 6 7 4 10 Use Prim's algorithm on the table in the insert to find a minimum spanning tree. Start by crossing out row A. Show which entries in the table are chosen and indicate the order in which the rows are deleted. Draw your minimum spanning tree and state its total weight.

The table shows the distances, in units of 100 m, between seven houses, A to G. A в D E F G A 4 5 3 6 B 4 1 4 7 5 1 3 4 6 7 D 3 2 3 2 4 E 4 4 6 F 7 6 10 G 6 7 4 10 Use Prim's algorithm on the table in the insert to find a minimum spanning tree. Start by crossing out row A. Show which entries in the table are chosen and indicate the order in which the rows are deleted. Draw your minimum spanning tree and state its total weight.

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

A) Give the minimum spanning tree using Prim’s algorithm (starting at vertex A). B) Give the minimum spanning tree using Kruskal’s algorithm. C) What is the total weight of the minimum spanning tree?
give a detailed explanation of how to create a minimum spanning tree using Prim's technique (MST) dont copy
Because many pairs of points have identical distances (e.g. dist(h,c) = dist(h,b) = dist(h,f) =sqrt(5)), the above diagram has more than one minimum-weight spanning tree. Determine the total number of minimum-weight spanning trees that exist in the above diagram. Clearly justify your answer.
THIS IS MY CODE HELP ME ACHIEVE POINTS OUTLINED BELOW : #include <stdio.h>#include <stdlib.h>#include <string.h>#include <float.h>#include "graph.h"#include "dijkstra.h" #define INFINITY DBL_MAX /* find shortest paths between source node id and all other nodes in graph. *//* upon success, returns an array containing a table of shortest paths. *//* return NULL if *graph is uninitialised or an error occurs. *//* each entry of the table array should be a Path *//* structure containing the path information for the shortest path between *//* the source node and every node in the graph. If no path exists to a *//* particular desination node, then next should be set to -1 and weight *//* to DBL_MAX in the Path structure for this node */Path *dijkstra(Graph *graph, int id, int *pnEntries){ int n; int i, j; int* nv = get_vertices(graph, &n); int *S = malloc(n * sizeof(int)); double *D = malloc(n * sizeof(double)); int *R = malloc(n…
Generate the shortest path tree using the Dijkstra Algorithm using the following format:Shortest path tree for node A1.Permanent list Tentative listempty A(0)2.Permanent list Tentative listA(0) B(5), C(2), D(3)3.Permanent list Tentative listA(0), C(2) B(5), D(3), E(6)4.Permanent list Tentative listA(0), C(2), D(3) B(5), D(3)5.Permanent list Tentative listA(0), C(2), D(3), B(5) D(3)6.Permanent list Tentative listA(0), C(2), D(3), B(5), D(3) empty
Given the graph below, run the Kruskal’s algorithm to find the minimum spanning tree. Show the algorithmic steps and label each edge by the order in which it was selected.
(3) Using the following graph, draw the Minimum Spanning Tree, and by using Dijkstra’s Algorithm give the shortest path from A to F (do not confuse F with E). You may either draw the shortest path, or write out the steps needed to follow the route you find.
Suppose that we had a general tree and that each node stores one integer value. Suppose, too, that we wanted to use tree traversal algorithms to find the maximum of all of the values stored in the nodes. If we used a depth-first traversal to find the maximum value, would this be considered a divide and conquer algorithm? Briefly explain why or why not. If we used a breadth-first traversal to find the maximum value, would this be considered a divide and conquer algorithm? Briefly explain why or why not.
Perform what is asked. Show your solutions.1. Given the expression A - B / C * (D + E), convert to PREFIX and POSTFIX.2. Given the expression (A / B) ^ C * D, convert to PREFIX and POSTFIX. 3. Given the expression A || B && !C || !D, convert to PREFIX and POSTFIX. 4. Create a binary search tree using the following insertions.44, 88, 55, 77, 33, 99, 66, 22, 25, 75Based on the final tree, what is the preorder traversal of the tree?5. Create a binary search tree using the following insertions.44, 88, 55, 77, 33, 99, 66, 22, 25, 75Based on the final tree, what is the postorder traversal of the tree?
i)- Write an algorithm to find the longest path in a DAG, where the length of the path is measured by the number of edges that it contains. What is the asymptotic complexity of your algorithm? ii) - Write an algorithm to find a maximum cost spanning tree, that is, the spanning tree with highest possible cost.
Find the minimum spanning tree using Prims algorithm and show the process step by step. (I gave here the picture of this question)
Give an argument for why the Prim's algorithm will always return a Minimum Spanning Tree?