Finding Neighboring Points In a Delaunay Triangulation

I am looking to find the coordinates of the natural neighbors of a given node in a delaunay triangulation or voronoi diagram. So far I have come across this where N will read off the neighbors of a triangle. But I did not understand what this meant, I thought points in an unstructured grid have neighbors rather a triangle.

x = rand([10,1]);
y = rand([10,1]);
TR = delaunayTriangulation(x,y);
N = neighbors(TR,1);

[darova]

TR variable has conectivity list (edges or triangles). Can't you use it?

[shan siddiqui]

Yes you are right I have now found this https://www.mathworks.com/matlabcentral/answers/361689-find-the-vertices-from-delaunay-triangulation?s_tid=answers_rc1-3_p3_MLT

which uses connectivity list like you sugested