Question 2a) Given the following undirected graph:LO513LO5Represent the graph as:(i) Adjacency matrix(ii) Adjacency list(iii) Incidence matrix426152024107332 b) Consider the following network. With the indicated link costs, useDijkstra's shortest-path algorithm to compute the shortest path from Ato all network nodes.(i) Show how the algorithm works by computing a table like the one discussedin class.(ii)Show all the paths from A to all other network nodes.StartA42B13U83735D1E4FG543H

Answered: Image /qna-images/answer/bff023ae-8763-4090-9cec-28eaac96bd16.jpg

Answered: Question 2 a) Given the following…

Question 2 a) Given the following undirected graph: 4 LO 5 1 3 LO 5 Represent the graph as: (i) Adjacency matrix (ii) Adjacency list (iii) Incidence matrix 4 2 6 15 20 2 4 10 7 3 3 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

Based on the undirected Graph G: e₁ es e10 V₁ es e6 e10 V4 e6 e3 V4 e9 e11 e3 eg e7 e11 e₂ e7 V₂ Undirected Graph G a) Find the degree of each vertex in the undirected Graph G. b) Find the adjacency matrix and incidence matrix of Graph G. c) If undirected Graph G is converted into a directed Graph G as in Figure 2, find the in- degree and out-degree for each vertices. e₁ es V5 e12 e2 V₂ es V5 e4 e12 e13 e4 e13. V3 Figure 2: Directed Graph G e14 V3 e14
Construct a graph based on the information given by the table. Then, analyse your graph and state whether it can be formed. Give explanation to support your statement. (c) Vertices Degree 1 5 2 4 1
QUESTION 3 A directed graph has 5 nodes and the following directed weighted edges: An edge of weight 4 from node 3 to 1; An edge of weight 4 from node 1 to 2; An edge of weight 5 from node 5 to 2; An edge of weight 4 from node 4 to 3; An edge of weight 4 from node 2 to 4; An edge of weight 3 from node 2 to 5; An edge of weight 3 from node 3 to 5; An edge of weight 5 from node 4 to 5; Construct the weight matrix W to represent this graph. Use Floyd Algorithm to find the Distance Matrix D giving the shortest distance from every node to the other nodes. Write the last row of the Distance Matrix here.
1. a. b. Using the provided graph, answer the following questions c./ 90 140 60 D 120 B 90 50 50 100 80 110 100 E 80 40 60 90 F Provide the MST generated using Kruskal's algorithm showing the order with which edges were added in Provide the MST generated using Prim's algorithm showing how the order of which edges were added in step by step Provide the overall weight of the MST generated from the following graph using Kruskal's algorithm
Given a Triangle of three vertices A(2,3), B(4,2), C(3,0), Apply the shearing to the Triangle with SH=4
Discrete Structure Graph and Tree
Determine whether a graph with the given adjacency matrix is bipartite.
Answer only number 7
(a) Draw an undirected graph G1 represented by the following adjacency matrix: 0 1 0 0 0 0 0 1 0 1 1 1 0 0 1 1 1 1 0 0 1 0 0 0 1 0 0 1 0 0 1 1 1 1 0 0 0 1 1 1 1 0 0 0 1 1 Does G1 contain a Hamiltonian cycle? Explain (b) Determine which pairs of graphs G1 in part (a) and G2 and G3 shown below are isomorphic and which are not, and explain your answer. If you use any invariant property in your argument, explain why this property is an invariant. Tex our answer. t 2 G2 G3 5. 7 8.