Last Updated: 28 Dec, 2020
M - Coloring Problem
Easy
Asked in companies
You are given an undirected graph with N nodes in the form of an adjacency matrix. You are also given an integer M.
Your task is to find if you can color the vertices of the graph using at most M colors such that no two adjacent vertices are of the same color.
For example:
If the given adjacency matrix is:
[0 1 0]
[1 0 1]
[0 1 0] and M = 3.
The given adjacency matrix tells us that node 1 is connected to node 2 and node 2 is connected to node 3.
So if we color vertex 1 with ‘red’, vertex 2 with ‘blue’, and vertex 3 with ‘red’, it is possible to color the given graph with two colors which is less than or equal to M.
Input Format:
The first line of input contains a single integer T, representing the number of test cases or queries to be run. Then the T test cases follow.
The first line of the test case contains two space-separated integers N and M, denoting the number of vertices in the undirected graph and the number of colors respectively.
Each of the next N lines of each test case contains N integers denoting a row of the adjacency matrix of the undirected graph.
Output Format:
For each test case, you need to print a single line containing “Yes” if we can color the given graph with at most M colors. otherwise, print “No”.
The output of each test case will be printed in a separate line.
Note:
You are not required to print the expected output, it has already been taken care of. Just implement the given function.
Constraints:
1 ≤ T ≤ 10
1 ≤ N ≤ 20
1 ≤ M ≤ N
Time Limit: 1 sec.
Approaches
- We will generate all possible combinations of colors possible for coloring the given graph.
- This can be done recursively by assigning a node each color from 1 to M and doing the same for all nodes.
- We further check if the adjacent vertices don’t have the same color.
- If we find such a combination of vertices, we return “Yes”. Otherwise, we return “No”.
- We will generate all possible combinations of colors possible for coloring the given graph.
- An optimisation in this method would be that, we would assign the colors after checking if it is possible to make the vertex of that color. In the brute force method, we were checking this after assigning all the colors.
- We would assign each vertex a color from 1 to M, check if its adjacent vertex has a different color or not.
- Finally, if we get a configuration such that each node is colored from 1 to M and adjacent vertices are of different color, we return “Yes”. Otherwise, we return “No”.