Cody

Problem 2730. Graph Algorithms 3: Number of Connected Components

Solution 549258

Submitted on 23 Dec 2014 by Binbin Qi
This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.
Solve This Problem View on Solution Map

Test Suite

Test Status Code Input and Output
1   Pass
%% a = ones(3) - eye(3); b = zeros(3); mat = [a b; b a]; n = 2; assert(isequal(cComponents(mat),n))

y = 2

2   Pass
%% a = randi(20); mat = ones(a) - eye(a); n = 1; assert(isequal(cComponents(mat),n))

y = 1

3   Pass
%% mat = [0 1 0 0 1; 1 0 1 0 0; 0 1 0 1 0; 0 0 1 0 1; 1 0 0 1 0]; assert(isequal(cComponents(mat),1))

y = 1

4   Pass
%% a = ones(3) - eye(3); b = zeros(3); mat = [a b b; b a b; b b a]; n = 3; assert(isequal(cComponents(mat),n))

y = 3

5   Pass
%% a = ones(3) - eye(3); b = zeros(3); p = floor((randi(20)+3)/3)*3; mat = []; for i= 1:p c = [repmat(b,1,i-1) a repmat(b,1,p-i)]; mat = [mat;c]; end assert(isequal(cComponents(mat),p))

y = 12

Suggested Problems

More from this Author44