Cody

Solution 2082606

Submitted on 7 Jan 2020 by Nicolas Douillet
  • Size: 37
  • 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.

This solution is outdated. To rescore this solution, sign in.

Test Suite

Test Status Code Input and Output
1   Pass
T = [1, 2, 3; 1, 3, 4; 1, 2, 4; 2, 3, 4]; t = 2; L = [1, 3, 4]'; assert(isequal(sort(find_neighbor_triangles_indices(T,t)),L))

2   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; 1, 4, 8; 1, 5, 8]; t = 3; L = [4, 6, 12]'; assert(isequal(sort(find_neighbor_triangles_indices(T,t)),L))

3   Pass
T = [1, 2, 3; 1, 3, 4; 1, 4, 5; 1, 2, 5; 2, 3, 6; 3, 4, 6; 4, 5, 6; 2, 5, 6; 2, 3, 4; 2, 4, 5; 1, 2, 4; 2, 4, 6]; t = 6; L = [2, 5, 7, 9, 12]'; assert(isequal(sort(find_neighbor_triangles_indices(T,t)),L))

Suggested Problems

More from this Author9