![subject](/tpl/images/cats/informatica.png)
Computers and Technology, 23.11.2020 01:00 webbjalia04
Consider an undirected graph G = (V, E), in which each node u 2 V may be colored
with some color between 1 and C. Your task is to write a program that determine the colors
for the uncolored nodes in the graph such that
• For all edges (u, v) 2 E, u and v have different colors.
• The number of additional colors needed is minimum.
Input (Standard input): Includes multiples lines. The first line contains two integers
1 n 1000, 1 m 100000 that correspond to the number of nodes and edges,
respectively.
Each of the following m lines contain two integers u and v, separated by one space,
to denote an edge from u to v. Nodes are numbered from 1 to n.
The last line contains n integers that are the colors of the nodes. Uncolored nodes
are indicated with color 0.
Output (Standard output): The first line contains an integer 0 D n that is the
number of additional colors needed to color all the uncolored nodes in the graph.
The next line contains n positive integers that are colors of the nodes.
Sample input/output:
Input -- Output
9 18 -- 1
1 2 -- 1 2 3 2 3 1 3 1 2
1 3
1 4
1 7
2 3
2 5
2 8
3 6
3 9
4 5
4 6
4 7
5 6
5 8
6 9
7 8
7 9
8 9
0 2 0 2 0 1 0 1 0
Explain of the input/output: The nodes in the graph are equivalent to 9 squares as
shown in the above figure. There is an edge between two squares if and only if they are on
a same row or column. The initial coloring of the nodes in the graph is shown in the middle
figure. We can use one additional color (color 3) to color all the remaining nodes.
I. Your program in Java/C++ that solves the above problem following the above input/
output format. A makefile and/or compiling instruction should be included if
you have multiple source files. Your program should not take more than 2 minutes to
terminate on any graph within the limits described in the Input section.
II. A report outline the numbers of colors used by your program on random graphs
assuming no nodes have any color at the beginning. The report should have at least two parts. Run your program for graphs of sizes 50, 100,..., 500 and report both the
number of used colors and the maximum degree.
Please give me answer in 2 Hours...
![ansver](/tpl/images/cats/User.png)
Answers: 2
![](/tpl/images/ask_question.png)
![](/tpl/images/ask_question_mob.png)
Another question on Computers and Technology
![question](/tpl/images/cats/informatica.png)
Computers and Technology, 23.06.2019 18:40
Johnson enterprises uses a computer to handle its sales invoices. lately, business has been so good that it takes an extra 3 hours per night, plus every third saturday, to keep up with the volume of sales invoices. management is considering updating its computer with a faster model that would eliminate all of the overtime processing.
Answers: 2
![question](/tpl/images/cats/informatica.png)
Computers and Technology, 24.06.2019 01:00
What shows the web address of the page that is currently displayed in the workspace? status window toolbar location bar internet box
Answers: 1
![question](/tpl/images/cats/informatica.png)
Computers and Technology, 24.06.2019 03:30
Auniform resource locator (url) is a formatted string of text that web browsers, email applications, and other software programs use to identify a particular resource on the internet. true false
Answers: 2
![question](/tpl/images/cats/informatica.png)
Computers and Technology, 24.06.2019 08:30
Intellectual property rights are exclusive rights that protect both the created and the creation. ipr offers exclusively what benefits to the person or people covered by it
Answers: 3
You know the right answer?
Consider an undirected graph G = (V, E), in which each node u 2 V may be colored
with some color be...
Questions
![question](/tpl/images/cats/biologiya.png)
Biology, 25.09.2019 04:30
![question](/tpl/images/cats/istoriya.png)
History, 25.09.2019 04:30
![question](/tpl/images/cats/en.png)
![question](/tpl/images/cats/mat.png)
Mathematics, 25.09.2019 04:30
![question](/tpl/images/cats/en.png)
![question](/tpl/images/cats/mat.png)
![question](/tpl/images/cats/mat.png)
Mathematics, 25.09.2019 04:30
![question](/tpl/images/cats/istoriya.png)
![question](/tpl/images/cats/mkx.png)
![question](/tpl/images/cats/obshestvoznanie.png)
Social Studies, 25.09.2019 04:30
![question](/tpl/images/cats/biologiya.png)
Biology, 25.09.2019 04:30
![question](/tpl/images/cats/mat.png)
![question](/tpl/images/cats/fizika.png)
Physics, 25.09.2019 04:30
![question](/tpl/images/cats/istoriya.png)
![question](/tpl/images/cats/mat.png)
![question](/tpl/images/cats/mat.png)
Mathematics, 25.09.2019 04:30
![question](/tpl/images/cats/geografiya.png)
Geography, 25.09.2019 04:30
![question](/tpl/images/cats/mat.png)
Mathematics, 25.09.2019 04:30
![question](/tpl/images/cats/obshestvoznanie.png)
![question](/tpl/images/cats/biologiya.png)
Biology, 25.09.2019 04:30