Cody

Solution 2115103

Submitted on 2 Feb 2020 by Nikolaos Nikolaou
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
T = [1 2 4;... 2 3 4;... 5 6 8;... 6 7 8;... 1 2 5;... 2 5 6;... 2 3 6;... 3 6 7;... 3 4 7;... 4 7 8;... 4 1 8;... 1 8 5]; i = 3; L = [2 4 6 7]; assert(isequal(sort(query_vertex_neighbors(T,i),2),L))

L = 2 4 6 7

2   Pass
T = [1 2 3;... 1 3 4;... 1 4 5;... 1 5 2;... 6 3 2;... 6 4 3;... 6 5 4;... 6 2 5]; i = 5; L = [1 2 4 6]; assert(isequal(sort(query_vertex_neighbors(T,i),2),L))

L = 1 2 4 6

3   Pass
T = [2 3 5;... 3 5 7;... 5 7 11;... 7 11 13]; i = 6; assert(isempty(query_vertex_neighbors(T,i)))

L = 0×1 empty double column vector