Struct GridGraph 

pub struct GridGraph {
    pub neighbors: Vec<Vec<NodeNeighbor>>,
}

A 4-connected grid graph over 2D points.

Each node has at most one neighbor per cardinal direction (Right, Left, Up, Down), selected as the best-scoring candidate from spatial proximity search.

Fields

neighbors: Vec<Vec<NodeNeighbor>>

Per-node adjacency list. neighbors[i] contains up to 4 validated neighbors of the point at index i.

Implementations

impl GridGraph

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

Build a 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 grid neighbors.
• params: controls KD-tree search parameters.