Database System Concepts
7th Edition
ISBN: 9780078022159
Author: Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher: McGraw-Hill Education
expand_more
expand_more
format_list_bulleted
Concept explainers
Question
Network Diagram, Shortest path and Minimum Spanning Tree
Application Example using RStudio
Case Background
The Wirehouse Lumber Company will soon begin logging eight groves of trees in the same general area. Therefore, it
must develop a system of dirt roads that makes each grove accessible from every other grove. The distance (in miles)
between every pair of groves is as follows:
Management now wishes to determine between which pairs of groves the roads should be constructed to connect all
groves with a minimum total length of road.
Requirement using RStudio:
(a) Create the Network Model
(b) Determine the shortest path from 1 to 8
(c) Generate the minimum spanning tree
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by stepSolved in 2 steps
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Similar questions
- Algorithm : (1. Single-destination Shortest Path, 2. Bellman-Ford, 3. Negative-Weight Cycles), Dynamic Programming, RNA Secondary Structure Consider n airports, labelled 1 through n. Each airport maintains a number of direct flights to other airports, represented by an edge with an associated cost. Since travel is currently restricted, one may only book direct flights—no airports will perform any transfers. However, things are beginning to open up again and airports are being slowly cleared to process transfers. These are done in order of label, so the first airport to allow transfers is 1, followed by 2, and so on. Once an airport is allowed to take transfers, flights through that airport may be booked. For example, consider the scenario depicted in Figure 1. When all airports are closed to transfers, flights may only be booked between airports connected by an edge. Thus, a flight from airport 5 to airport 2 may not be booked. However, once airport 1 is allowed to perform…arrow_forwardSimulation of bank calling system [Problem Description] Using linear list to simulate the bank's queuing business model [Basic Requirements] Suppose that the working hours of the bank are from 9 a.m. to 5 p.m The time when customers arrive at the bank is generated randomly, and the customers are queued in the order of arrival. The time required for each customer to handle business can also be generated randomly, no more than 30 minutes. If the randomly generated time length is 0, it indicates that the customer leaves early and does not handle business. When the program is running, input the number of bank windows, and then output the basic information of each customer's business in the bank according to the randomly generated customer data (arrival time, time required for business), including: customer arrival time, customer waiting time, what time the customer handled business in which window, and how long the business lasted. From this, we can observe the average waiting time of…arrow_forwardScenario A (Question 1-3) Acme engineering is a general light engineering company that specializes in metallic fixtures and fittings. It manufactures various products to customer order, and also has long term contracts to supply manufactured products to other companies. Acme is a "jobbing shop" involving craftspeople making specialized complete products - it is not a production line operation. The craftspeople work on early (6am-2pm) and late (2pm-10pm) shifts 5 days a week, and sometimes do overtime on Saturdays.. The factory is always closed on Friday. Each shift has a supervisor. The management team consists of the Managing Director, Accountant and Sales Manager. They are assisted by two Administrative Assistants who work Sunday to Thursday, 8.30am to 5.30pmS pe cify indicators for the conligency The management team has decided that, in order to become more competitive, it needs more and better information on the costs involved in manufacturing: It wants to build up a database of…arrow_forward
- Portfolio manager Max Gaines needs to develop an investment portfolio for his clients who are willing to accept a moderate amount of risk. His task is to determine the proportion of the portfolio to invest in each of the five mutual funds listed below so that the portfolio maximizes the expected return but provides an annual return of no less than 3%. for each of the following scenarios. Annual Returns (Planning Scenarios): mutual fund yr 1 yr 2 yr 3 yr 4 international stock 22.37 26.73 6.46 -3.19 low-cap blend 14.88 18.61 10.52 5.25 mid-cap blend 19.45 18.04 5.91 -1.94 small-cap blend 13.79 11.33 -2.07 6.85 intermediate bond 7.29 8.05 9.18 3.92 Formulate the appropriate linear program for this situation. (state the objective function, the decision variables, and the constraints)arrow_forwardDynamic ProgrammingConsider the following network below: (a) Label all of the nodes such that for every arc, (i,j), where i is the start and j the end node for the arc, the labels satisfy i < j.(b) Why can we use the node labeling algorithm to label the nodes in this network? (c) Use forward DP to find the shortest path from your first labeled node to every node in the network.(d) What fundamental characteristic of dynamic programs allow us to breakdown large-sized problems into a series of smaller-sized problems? What does this characteristic establishes?arrow_forwarda) Given the following undirected graph: 4 1 5 3 Represent the graph as: (i) Adjacency matrix (ii) Adjacency list (iii) Incidence matrix 5 9 A 6 15 20 2 10 7 3 درا 2arrow_forward
arrow_back_ios
arrow_forward_ios
Recommended textbooks for you
- Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill EducationStarting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSONDigital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
- C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSONDatabase Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage LearningProgrammable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education