Question 6 A graph can be presented pictorially. The vertices are drawn as circles and a label inside the circle represents the vertex. Each vertex connected with each other through a line. Each line may be directed or undirected. (a) List TWO (2) applications that may implement graph data structure concept. (b) Consider the graph shows in Figure 3 and answer the following questions: Figure 3: Directed graph i. Write down the order in which the vertices will be visited by a depth first search starting from the node A. If there are multiple valid choices, then assume that the alphabetically earlier vertices will be visited first. Show your working steps.

Question 6 A graph can be presented pictorially. The vertices are drawn as circles and a label inside the circle represents the vertex. Each vertex connected with each other through a line. Each line may be directed or undirected. (a) List TWO (2) applications that may implement graph data structure concept. (b) Consider the graph shows in Figure 3 and answer the following questions: Figure 3: Directed graph i. Write down the order in which the vertices will be visited by a depth first search starting from the node A. If there are multiple valid choices, then assume that the alphabetically earlier vertices will be visited first. Show your working steps.

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

1. Write a program (WAP) to create an undirected graph using adjacency matrix representation.Number of nodes and edges should be taken from the user. After creating the graph, performfollowing operations: (i) Search a node. Take the node number from the user. If the node is found then print its associatededges.(ii) Insert a node in the graph.(iii) Insert an edge in the graph. Take the node numbers from the user between which the edge is tobe inserted.(iv) Delete a node from the graph. Take the node number to be deleted from the user.(v) Apply DFS on the graph and print the graph traversal.(vi) Apply BFS on the graph and print the graph traversal.2. Solve the above problem using adjacency list representation.
Part 3 - Number is 9 Part 3: Graph TheoryUse your assigned number of vertices from “Part 3” of the “Finite Math Assignment Form: Task 3” supporting document to do the following: F. Create a weighted connected graph with the following characteristics: • The assigned number of vertices are alphabetically labeled starting with A. • Vertex A is not adjacent to vertex G. • At least two vertices have a degree greater than 2. • All weights are greater than 0. • No weights are the same. 1. Identify the degree of each vertex in your graph. 2. Explain whether the graph has an Euler trail, using definitions, properties, or theorems. 3. Describe a path from vertex A to G. 4. Find the total weight of the path from part F3. Show all work.
The Graph Data Structure is made up of nodes and edges. (A Tree Data Structure is a special kind of a Graph Data Structure). A Graph may be represented by an Adjacency Matrix or an Adjacency List. Through this exercise, you should be able to have a better grasp the Adjacency Matrix concept. You are expected to read about the Adjacency Matrix concept as well as the Adjacency List concept. Suppose the vertices A, B, C, D, E, F, G and H of a Graph are mapped to row and column indices(0,1,2,3,4,5,6,and 7) of a matrix (i.e. 2-dimensional array) as shown in the following table. Vertex of Graph Index in the 2-D Array Adjacency Matrix Representation of Graph A B 2 F 6. H 7 Suppose further, that the following is an Adjacency Matrix representing the Graph. 3 4 5. 6. 7 0. 1 1 1 1 01 1 01 1. 3 14 1 1 1 6. 1 Exercise: Show/Draw the Graph that is represented by the above Adjacency matrix. Upload the document that contains your result. (Filename: AdjacencyMatrixExercise.pdf) Notes: -The nodes of the…
Graph is a type of non-linear data structure that consists of vertices or nodes connected by edges or links for storing data. GIVE the application of Graph data structure
Part C: Function, for and plotting We did a project in the lecture on calculating the free fall speeds and plotting them on a graph. This part is similar to the project. An engineer has derived a relationship between the force applied to a material and the extension in length that the force would cause. The relationship between force f and extension e is given by: You are asked to plot a graph showing the relationship between force and extension. You are asked to complete the following tasks: Task 1 Write a Python function which returns the value of e for a given input f. Do not use literals (e.g. 5.5, 10) in the expressions for e in the function. Instead you should define constants and use them. Note that the relationship between e and f depends on whether f is bigger than 10 or not, this means you need a certain Python construction in your function. If you can't think of that, have a look at Part A of Lab03.
Please explain Some engineers at Google want you to implement a graph structure of the subway system in Boston showing the connections between each station.They are wondering what data structure to use to represent the graph and use the least amount of memory, given that most stations do not connect to many other stations. Which graph data structure representation should you use and why? Group of answer choices a. Adjacency List -- Because the complexity is O(V+E), the data structure is better at representing sparse graphs since their are fewer connections. b. Adjacency Matrix -- Because the complexity is O(V+E), the data structure is better at representing sparse graphs since their are fewer connections.
1) Describe the Graph Data Structure: What's the difference between an undirected and a directed data structure graph? There's something called a weighted graph in relation to the data structure graph.
Consider the following graph. 2 1) 4 Visually show how this graph will be saved in an adjacency matrix. Visually show how this graph will be saved in an adjacency list. Note: You only have to show the final adjacency matrix and adjacency list. No code required. 3.
5. A social graph is the representation, through a graph, of the virtual relationships that a user has within a social network. For example, in a social graph, vertices can represent users and edges can represent relationships between users. Under this concept, give a recursive definition of all users that are related to a user u in a social network.
3. Draw Edge List Structure, Adjacency List Structure and Adjacency Matrix Structure representation of the following graph: 4 A 1
Information Cascades It’s election season and two candidates, Candidate A and Candidate B, are in a hotly contested city council race in rainy Eastmoreland. You are a strategic advisor for Candidate A in charge of election forecasting and voter acquisition tactics. Based on careful modeling, you’ve created one possible version of the social graph of voters. Your graph has 10,000 nodes, where nodes are denoted by an integer ID between 0 and 9999. The edge lists of the graphs are provided in the homework bundle. Both graphs are undirected. Given the hyper-partisan political climate of Eastmoreland, most voters have already made up their minds: 40% know they will vote for A, 40% know they will vote for B, and the remaining 20% are undecided. Each voter’s support is determined by the last digit of their node id. If the last digit is 0–3, the node supports A. If the last digit is 4–7, the node supports B. And if the last digit is 8 or 9, the node is undecided. The undecided voters will go…
Assignment on Graph A social graph contains all the friendship relations (edges) among a group of n people (vertices). The friendship relationship is symmetric. Two vertices with no edge between them are enemies. Design and implement a class called Graph for a social graph. It should have an adjacency matrix as a data member to represent the graph. The nodes in the graph are numbered from 0..n-1 graph[i][i] - is always true (1) graph[i][j] is true if i and j are friends and false (0) if they are enemies. • In the constructor, initialize all entries to false (0) and all graph[i][i] to true (1) Include the following member functions. o void makeFriends(int i,intj)- make i and j friends int countFriends(int i) - will return the number of friends of i, excluding itself int countEnemies(int i)- will return the number of enemies of i int countCommonFriends(int i,intj) - the number of common friends of i and j int countCommonEnemies(int i,intj) - the number of common enemies of i and j int…