As you test your function, you should make sure that if your graph g is > g <- make.network('SW', 40, 2, 0.0) then every call disconnect.network(g) returns a value of 2. If you define > g <- make.network('SW', 40, 4, 0.0) Using igraph in R, write a function named disconnect.network that accepts as input a network and takes that network and (in a while-loop) removes random edges, one at a time, until the network becomes disconnected
As you test your function, you should make sure that if your graph g is > g <- make.network('SW', 40, 2, 0.0) then every call disconnect.network(g) returns a value of 2. If you define > g <- make.network('SW', 40, 4, 0.0) Using igraph in R, write a function named disconnect.network that accepts as input a network and takes that network and (in a while-loop) removes random edges, one at a time, until the network becomes disconnected
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
Related questions
Question
(As you test your function, you should make sure that if your graph g is
> g <- make.network('SW', 40, 2, 0.0)
then every call disconnect.network(g) returns a value of 2. If you define
> g <- make.network('SW', 40, 4, 0.0)
Using igraph in R, write a function named disconnect.network that accepts as input a network
and takes that network and (in a while-loop) removes random edges, one at a time, until the
network becomes disconnected. The function should return the number of edges that had to
be removed in order to change the value of components(g)$no to a number greater than one.
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 2 steps with 2 images
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.Recommended textbooks for you
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
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