A CO 2 9. 8 7 3 D G 15 9 5 F E 1 Given the above weighted graph (undirected): a) Determine and draw a Minimum Spanning Tree (MST) of the given graph above. Indicate the minimum weighted sum. No steps required. Students may choose whichever algorithm to find the MST. b) Find the shortest path from source node D to destination node G of the given graph above, using Dijkstra's algorithm. Show your steps with a table as in our course material, clearly indicating the node being selected for processing in each step. c) Draw ONLY the shortest path obtained above, from source node D to destination node G, and indicate its weighted sum. B. 2)

A CO 2 9. 8 7 3 D G 15 9 5 F E 1 Given the above weighted graph (undirected): a) Determine and draw a Minimum Spanning Tree (MST) of the given graph above. Indicate the minimum weighted sum. No steps required. Students may choose whichever algorithm to find the MST. b) Find the shortest path from source node D to destination node G of the given graph above, using Dijkstra's algorithm. Show your steps with a table as in our course material, clearly indicating the node being selected for processing in each step. c) Draw ONLY the shortest path obtained above, from source node D to destination node G, and indicate its weighted sum. B. 2)

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

Determine the order of graph traversal using DFS starting from F with clockwise direction!
Implement this solution in Java
Java
Transcribed Image Text Use the following graph for this problem. Where needed and not determined by the d) algorithm, assume that any algorithm begins at node A. 10 E 5 4 1 3 8. 1 6. F 5 Step through Dijkstra's Algorithm to calculate the single source shortest path from A to every other vertex. You only need to show your final table, but you should show your steps in the table below for partial credit. Show your steps by crossing through values that are replaced by a new value. [Ref. Graph in figure] Vertex Known Distance Path B D E G i) In what order would Dijkstra's algorithm mark each node as known? ii) iii) What is the shortest (weighted) path from A to G? What is the length (weighted cost) of the all shortest path
Write a program that creates the minimum spanning tree for the graph in Figure
The following table(picture) presents the implementation of the Dijkstra algorithm on the evaluated graph G with 8 vertices. How many different shortest paths exist in the graph G between the vertices a and g?
c) Given the following Graph and after applying Dijkstra algorithm, the final table looks as given below. 16 10 11 12 XXX H 4 18 Fr Vertex known d. T A 7 B T 0 15 H 19 C 41 M J B C D E F G I J JJ K L M T T T T T T T T T T T 6 2 20 5 7 14 31 P G 10 K 30 D G J K T 10 560 From this information, find out the shortest path from the source vertex B to vertex I, trace the path and also find out the shortest distance.
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
Kruskal's minimum spanning tree algorithm is executed on the following graph. Select all edges from edgeList that belong to the minimum spanning tree. edgeList result List AD BC BE CF EF DG EG EH GH D 7 9 G 1 B 5 3 A E H 4 2 6 8 F
b. Using Kruskal's algorithm find the minimum spanning tree of the given graph. 70 B 20 30 50 D 60 10 C 40 E
Petermine the shortest path using Dijkstra's algorithm from node z to all other nodes in the network. You need to draw a table similar to the one shown in class and clearly illustrate all the steps. You will not get credit for just writing the final answer. 12 7 6 8. 4. 3.
handwritten please