Bicoloring Online judge (10004) problem with solution in python

In 1976 the “FourColorMapTheorem” was proven with the assistance of a computer. This theorem states that every map can be colored using only four colors, in such a way that no region is colored using the same color as a neighbor region.

Here you are asked to solve a simpler similar problem. You have to decide whether a given arbitrary connected graph can be bicolored. That is, if one can assign colors (from a palette of two) to the nodes in such a way that no two adjacent nodes have the same color. To simplify the problem you can assume:

no node will have an edge to itself.

the graph is non-directed. That is, if a node a is said to be connected to a node b, then you must assume that bis connected to a.

the graph will be strongly connected. That is, there will be at least one path from any node to any other node.

Input :

The input consists of several test cases. Each test case starts with a line containing the number n (1 < n < 200) of different nodes. The second line contains the number of edges l. After this, l lines will follow, each containing two numbers that specify an edge between the two nodes that they represent.

A node in the graph will be labeled using a number a (0 a < n).

An input with n = 0 will mark the end of the input and is not to be processed.

Output :

You have to decide whether the input graph can be bicolored or not, and print it as shown below.

Solution :

				
					def isSafe(graph, color):
	for i in range(3):
		for j in range(i + 1, 3):
			if (graph[i][j] and color[j] == color[i]):
				return False
	return True
def graphColoring(graph, m, i, color):	
	if (i == 3):
		if (isSafe(graph, color)):
			printSolution(color)
			return True
		return False

	for j in range(1, m + 1):
		color[i] = j
		if (graphColoring(graph, m, i + 1, color)):
			return True
		color[i] = 0
	return False
def printSolution(color):
	print("Solution Exists:" " Following are the assigned colors ")
	for i in range(3):
		print(color[i],end=" ")


no_of_vertex=int(input())
No_of_egd=int(input())
graph=[[0]*no_of_vertex for i in range(no_of_vertex)]
edge=[]
for i in range(No_of_egd):
    k=list(map(int,input().split()))
    edge.append(k)
    edge.append(k[::-1])
for i in range(no_of_vertex):
    for j in range(no_of_vertex):
        if [i,j] in edge:
            graph[i][j]=1     
m=2
color = [0 for i in range(3)]
if (not graphColoring(graph, m, 0, color)):
    print ("Solution does not exist")
				
			

Sample Input :

3
3
0 1
1 2
2 0
3
2
0 1
1 2
9
8
0 1
0 2
0 3
0 4
0 5
0 6
0 7
0 8
0

Sample Output :

NOT BICOLORABLE.
BICOLORABLE.
BICOLORABLE.


0 Comments

Leave a Reply

Avatar placeholder

Your email address will not be published.