Cody

Problem 2461. Graph Algorithms - 2 : Chromatic Number

Solution 1792492

Submitted on 18 Apr 2019
This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.

Test Suite

Test Status Code Input and Output
1   Fail
x = [0 1 1 0; 1 0 1 1 ; 1 1 0 0 ; 0 1 0 0]; y_correct = 3; assert(isequal(gColor(x),y_correct))

Output argument "y" (and maybe others) not assigned during call to "gColor". Error in Test1 (line 3) assert(isequal(gColor(x),y_correct))

2   Fail
x = [0 1 0 0 1 0 1;1 0 1 0 0 0 1; 0 1 0 1 0 0 1; 0 0 1 0 0 1 1 ; 1 0 0 0 0 0 1 ; 0 0 0 1 0 0 1; 1 1 1 1 1 1 0]; y_correct = 3; assert(isequal(gColor(x),y_correct))

Output argument "y" (and maybe others) not assigned during call to "gColor". Error in Test2 (line 3) assert(isequal(gColor(x),y_correct))

3   Fail
x = fliplr(eye(2)); y_correct = 2; assert(isequal(gColor(x),y_correct));

Output argument "y" (and maybe others) not assigned during call to "gColor". Error in Test3 (line 3) assert(isequal(gColor(x),y_correct));

4   Fail
x = [0 1 1 0 1;1 0 0 1 0;1 0 0 1 0;0 1 1 0 1;1 0 0 1 0]; y_correct = 2; assert(isequal(gColor(x),y_correct));

Output argument "y" (and maybe others) not assigned during call to "gColor". Error in Test4 (line 3) assert(isequal(gColor(x),y_correct));

5   Fail
x = [0 1 1 0 1;1 0 0 1 0;1 0 0 1 0;0 1 1 0 1;1 0 0 1 0]; y_correct = 2; assert(isequal(gColor(x),y_correct)); x = zeros(2); % two vertices, not connected by any edge y_correct = 1; assert(isequal(gColor(x),y_correct));

Output argument "y" (and maybe others) not assigned during call to "gColor". Error in Test5 (line 3) assert(isequal(gColor(x),y_correct));