Cody

Problem 2647. Find the maximal cliques in an undirected graph

Solution 1681963

Submitted on 28 Nov 2018 by Binbin Qi
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   Pass
A = 0; assert(isequal(maximalcliques(A),1))

2   Pass
for ii=1:10 N = randi(100); A = ones(N)-eye(N); assert(isequal(maximalcliques(A),ones(N,1))) end

3   Pass
for ii=1:10 N = randi(100); A = zeros(N); C = maximalcliques(A); assert(isequal(fliplr(sortrows(C')'),eye(N))) end

4   Pass
A = [ 0 0 0 0 0 0 0 1 0 0 0 0 0 1 0 0 ]; C = maximalcliques(A); C = fliplr(sortrows(C')'); C_correct = [ 1 0 0 0 1 0 0 0 1 0 1 0 ]; assert(isequal(C,C_correct))

5   Pass
A = [ 0 1 0 0 0 1 0 1 1 0 0 1 0 1 0 0 1 1 0 1 0 0 0 1 0 ]; C = maximalcliques(A); C = fliplr(sortrows(C')'); C_correct = [ 1 0 0 1 1 0 0 1 0 0 1 1 0 0 1 ]; assert(isequal(C,C_correct))

6   Pass
A = [ 0 1 1 0 0 0 1 0 1 1 0 0 1 1 0 0 1 0 0 1 0 0 1 0 0 0 1 1 0 1 0 0 0 0 1 0 ]; C = maximalcliques(A); C = fliplr(sortrows(C')'); C_correct = [ 1 0 0 0 0 1 1 0 0 0 1 0 1 0 0 0 1 0 1 0 0 0 1 1 1 0 0 0 0 1 ]; assert(isequal(C,C_correct))

Suggested Problems

More from this Author44

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!