Cody

# Problem 2458. Graph Algorithms - 1 : Length of the largest closed path

Solution 566755

Submitted on 27 Jan 2015 by Jan Orwat
• Size: 21
• This is the leading solution.
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
%% x = [0 0 1 0 0 0; 0 0 0 1 0 1; 1 0 0 0 1 0;0 1 0 0 0 1; 0 0 1 0 0 0; 0 1 0 1 0 0]; y_correct = 3; assert(isequal(lCycle(x),y_correct))

2   Pass
%% x = [0 1 0;1 0 1;0 1 0]; y_correct = 2; assert(isequal(lCycle(x),y_correct))

3   Pass
%% x = ones(5).*(~eye(5)); y_correct = 5; assert(isequal(lCycle(x),y_correct))

4   Pass
%% x = ones(10).*(~eye(10)); y_correct = 10; assert(isequal(lCycle(x),y_correct))

5   Pass
%% x = [0 1 0 0 0 1]; for i = 1:length(x) a(i,:) = circshift(x,[0 (i-1)]); end y_correct = 6; assert(isequal(lCycle(a),y_correct))

### Community Treasure Hunt

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

Start Hunting!