nodes: 0, module; 1, function_definition; 2, function_name:identify_vertex_neighbours; 3, parameters; 4, block; 5, identifier:self; 6, identifier:vertex; 7, expression_statement; 8, expression_statement; 9, expression_statement; 10, expression_statement; 11, expression_statement; 12, return_statement; 13, comment:"""
          Find the neighbour-vertices in the triangulation for the given vertex
          Searches self.simplices for vertex entries and sorts neighbours
          """; 14, assignment; 15, assignment; 16, assignment; 17, call; 18, identifier:neighbour_array; 19, identifier:simplices; 20, attribute; 21, pattern_list; 22, call; 23, identifier:neighbour_array; 24, call; 25, attribute; 26, argument_list; 27, identifier:self; 28, identifier:simplices; 29, identifier:ridx; 30, identifier:cidx; 31, attribute; 32, argument_list; 33, attribute; 34, argument_list; 35, identifier:neighbour_array; 36, identifier:remove; 37, identifier:vertex; 38, identifier:np; 39, identifier:where; 40, comparison_operator:simplices == vertex; 41, call; 42, identifier:tolist; 43, identifier:simplices; 44, identifier:vertex; 45, attribute; 46, argument_list; 47, identifier:np; 48, identifier:unique; 49, call; 50, attribute; 51, argument_list; 52, identifier:np; 53, identifier:hstack; 54, list; 55, subscript; 56, identifier:simplices; 57, identifier:ridx
code: def identify_vertex_neighbours(self, vertex):
          """
          Find the neighbour-vertices in the triangulation for the given vertex
          Searches self.simplices for vertex entries and sorts neighbours
          """
          simplices = self.simplices
          ridx, cidx = np.where(simplices == vertex)
          neighbour_array = np.unique(np.hstack([simplices[ridx]])).tolist()
          neighbour_array.remove(vertex)
          return neighbour_array