Hello,
There is definitely and intentionally no such data structure, it would be a compact matrix data structure, which is outdated by the Element By Element matrix storage and also by the edge-based storage. Every time you fancy an algorithm that needs to know the nodes around another node, you can find a more efficient algorithm that loops over the elements, where the connectivity table IKLE can be used. For example finding the nearest point around a point is best done with a loop on elements.
On the contrary we do have an array giving one element a point belongs to. It is used for starting the computation of trajectories in the module streamline. This array is in the BIEF_MESH structure. Given a mesh MESH, MESH%ELTCAR%I(N) is AN element to which belongs point N. Beware that in parallel you may get 0 if this element is in another subdomain.
With best regards,
Jean-Michel Hervouet