eon.geometry.neighbors¶
Neighbor lists via vesin (PBC-aware).
Historically eOn used a Python sweep-and-prune or an O(N²) brute loop.
Both paths now go through :class:vesin.NeighborList, which is the supported
geometry kernel for pair finding. The brute flag is retained for API
compatibility but no longer selects a different algorithm.
Module Contents¶
Functions¶
Return neighbors within cutoff for each atom (PBC, full undirected list). |
|
Alias of :func: |
|
Neighbor list with minimum-image vectors from center → neighbor. |
|
Indices of free atoms with the lowest coordination number. |
Data¶
API¶
- eon.geometry.neighbors.StructureLike¶
None
- eon.geometry.neighbors.neighbor_list(p: eon.geometry.neighbors.StructureLike, cutoff: float, brute: bool = False) List[List[int]]¶
Return neighbors within cutoff for each atom (PBC, full undirected list).
Parameters
p Structure with
.r(N,3) and.box(3,3). cutoff Pair cutoff distance. brute Ignored; kept so callers usingconfig.comp_brute_neighborsneed no change.
- eon.geometry.neighbors.brute_neighbor_list(p: eon.geometry.neighbors.StructureLike, cutoff: float) List[List[int]]¶
Alias of :func:
neighbor_list(historical name).
- eon.geometry.neighbors.neighbor_list_vectors(p: eon.geometry.neighbors.StructureLike, cutoff: float, brute: bool = False) List[List[numpy.ndarray]]¶
Neighbor list with minimum-image vectors from center → neighbor.