You're given a simple undirected graph G with N vertices and M edges. You have to assign, to each vertex i, a number C; such that 1 ≤ C; < N and Vi‡j, C; ‡ C₁. For any such assignment, we define D; to be the number of neighbours j of i such that C; < C₁. You want to minimise maxi{[1..N) Di - minic{1..N} Di. 3 Output the minimum possible value of this expression for a valid assignment as described above, and also print the corresponding assignment. Note: • The given graph need not be connected. • If there are multiple possible assignments, output anyone. • Since the input is large, prefer using fast input-output methods.
You're given a simple undirected graph G with N vertices and M edges. You have to assign, to each vertex i, a number C; such that 1 ≤ C; < N and Vi‡j, C; ‡ C₁. For any such assignment, we define D; to be the number of neighbours j of i such that C; < C₁. You want to minimise maxi{[1..N) Di - minic{1..N} Di. 3 Output the minimum possible value of this expression for a valid assignment as described above, and also print the corresponding assignment. Note: • The given graph need not be connected. • If there are multiple possible assignments, output anyone. • Since the input is large, prefer using fast input-output methods.
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
100%
Transcribed Image Text:Please Answer this in Python language:
You're given a simple undirected graph G with N vertices and M edges. You have to assign, to each
vertex i, a number C; such that 1 ≤ C; ≤ N and Vi‡j, C; ‡ Cj.
For any such assignment, we define D; to be the number of neighbours j of i such that C; < C₁.
You want to minimise maai[1..N) Di - mini[1..N) Di.
Output the minimum possible value of this expression for a valid assignment as described above,
and also print the corresponding assignment.
Note:
The given graph need not be connected.
• If there are multiple possible assignments, output anyone.
• Since the input is large, prefer using fast input-output methods.
Input
1
57
12
13
14
23
24
25
35
Output
2
43251
Q
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 3 steps with 1 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