Elon Musk is running the graph construction business. A client has asked for a special graph. A graph is called special if it satisfies the following properties: • It has <105 vertices. It is a simple, undirected, connected 3-regular graph. It has exactly

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question
Transcribed Image Text

Elon Musk is running the graph construction business. A client has asked for a special graph. A graph is called special if it satisfies the following properties: • It has <105 vertices. It is a simple, undirected, connected 3-regular graph. It has exactly k bridge edges, (k given as input). For a graph G, define f(G) to be the minimum number of edges to be removed from it to make it bipartite. The client doesn't like graphs with a high value of f, so you have to minimize it. If there doesn't exist any special graph, print –1. Otherwise, find a special graph G with the minimum possible value of f(G) and also find a subset of its edges of size f(G) whose removal makes it bipartite. In case there are multiple such graphs, you can output any of those. Elon has assigned this task to you, now vou have to develon a C++ code that takes bridge edges as innut and print all the possible granhs

Elon Musk is running the graph construction business. A client has asked for a special graph. A graph
is called special if it satisfies the following properties:
It has <105 vertices.
It is a simple, undirected, connected 3-regular graph.
It has exactly k bridge edges, (k given as input).
For a graph G, define f(G) to be the minimum number of edges to be removed from it to make it
bipartite. The client doesn't like graphs with a high value of f, so you have to minimize it. If there
doesn't exist any special graph, print -1. Otherwise, find a special graph G with the minimum possible
value of f(G) and also find a subset of its edges of size f(G) whose removal makes it bipartite. In case
there are multiple such graphs, you can output any of those. Elon has assigned this task to you, now
you have to develop a C++ code that takes bridge edges as input and print all the possible graphs.
Sample Test Case:
Input
Output
1
11 15
13
14
24
15
25
34
56
69
79
8 9
6 10
7 10
8 10
78
37 15
H N - 2- 235
Transcribed Image Text:Elon Musk is running the graph construction business. A client has asked for a special graph. A graph is called special if it satisfies the following properties: It has <105 vertices. It is a simple, undirected, connected 3-regular graph. It has exactly k bridge edges, (k given as input). For a graph G, define f(G) to be the minimum number of edges to be removed from it to make it bipartite. The client doesn't like graphs with a high value of f, so you have to minimize it. If there doesn't exist any special graph, print -1. Otherwise, find a special graph G with the minimum possible value of f(G) and also find a subset of its edges of size f(G) whose removal makes it bipartite. In case there are multiple such graphs, you can output any of those. Elon has assigned this task to you, now you have to develop a C++ code that takes bridge edges as input and print all the possible graphs. Sample Test Case: Input Output 1 11 15 13 14 24 15 25 34 56 69 79 8 9 6 10 7 10 8 10 78 37 15 H N - 2- 235
Expert Solution
steps

Step by step

Solved in 2 steps with 1 images

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY