Cody

Problem 2646. Determine the number of maximal cliques in an undirected graph

Solution 517720

Submitted on 28 Oct 2014 by Matthew Eicholtz
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),1)) end

3   Pass
%% for ii=1:10 N = randi(100); A = zeros(N); assert(isequal(maximalcliques(A),N)) end

4   Pass
%% A = [ 0 0 0 0 0 0 0 1 0 0 0 0 0 1 0 0 ]; assert(isequal(maximalcliques(A),3))

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 ]; assert(isequal(maximalcliques(A),3))

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 ]; assert(isequal(maximalcliques(A),5))