Struct HexGridGraph 

pub struct HexGridGraph<F: Float = f32> {
    pub neighbors: Vec<Vec<HexNodeNeighbor<F>>>,
}

A 6-connected hex grid graph over 2D points.

Each node has at most one neighbor per hex direction, selected as the best-scoring candidate from spatial proximity search.

Fields

neighbors: Vec<Vec<HexNodeNeighbor<F>>>

Per-node adjacency list. neighbors[i] contains up to 6 validated neighbors.

Implementations

impl<F: Float + Axis> HexGridGraph<F>

pub fn build<V: HexNeighborValidator<F>>( positions: &[Point2<F>], point_data: &[V::PointData], validator: &V, params: &GridGraphParams<F>, ) -> Self

Build a hex grid graph from 2D points using a caller-supplied validator.

• positions: 2D point positions for spatial search.
• point_data: per-point data passed to the validator (same length as positions).
• validator: determines which spatial neighbors are valid hex grid neighbors.
• params: controls KD-tree search parameters.