Struct GridGraph 

pub struct GridGraph<A> {
    pub height: usize,
    pub width: usize,
    _marker: PhantomData<fn() -> A>,
}

Fields

height: usize

width: usize

_marker: PhantomData<fn() -> A>

Implementations

impl GridGraph<Adj4>

pub fn new_adj4(height: usize, width: usize) -> Self

pub fn adj4(&self, vid: (usize, usize)) -> GridAdjacency<'_, Adj4>

impl GridGraph<Adj8>

pub fn new_adj8(height: usize, width: usize) -> Self

pub fn adj8(&self, vid: (usize, usize)) -> GridAdjacency<'_, Adj8>

impl<A> GridGraph<A>

pub fn new(height: usize, width: usize) -> Self

Examples found in repository

crates/competitive/src/graph/grid.rs (line 13)

    pub fn new_adj4(height: usize, width: usize) -> Self {
        Self::new(height, width)
    }
    pub fn adj4(&self, vid: (usize, usize)) -> GridAdjacency<'_, Adj4> {
        GridAdjacency {
            g: self,
            xy: vid,
            diter: GridDirectionIter::default(),
            _marker: PhantomData,
        }
    }
}
impl GridGraph<Adj8> {
    pub fn new_adj8(height: usize, width: usize) -> Self {
        Self::new(height, width)
    }

pub fn move_by_diff( &self, xy: (usize, usize), dxdy: (isize, isize), ) -> Option<(usize, usize)>

Examples found in repository

crates/competitive/src/graph/grid.rs (line 244)

    fn next(&mut self) -> Option<Self::Item> {
        for dir in self.diter.by_ref() {
            match self.g.move_by_diff(self.xy, dir.dxdy()) {
                Some(nxy) => return Some((nxy, dir)),
                None => continue,
            }
        }
        None
    }

pub fn flat(&self, xy: (usize, usize)) -> usize

pub fn unflat(&self, pos: usize) -> (usize, usize)

Trait Implementations

impl<A: Clone> Clone for GridGraph<A>

fn clone(&self) -> Self

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<A: Copy> Copy for GridGraph<A>

impl<A: Debug> Debug for GridGraph<A>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<A> Graph for GridGraph<A>

where GridDirectionIter<A>: Iterator<Item = GridDirection>,

type Vertex = (usize, usize)

type Label = GridDirection

type Vertices<'g> = GridVertices where A: 'g

type Neighbors<'g> = Map<GridAdjacency<'g, A>, fn(((usize, usize), GridDirection)) -> Neighbor<(usize, usize), GridDirection>> where A: 'g

fn vsize(&self) -> usize

fn vertices(&self) -> Self::Vertices<'_>

fn neighbors(&self, vertex: Self::Vertex) -> Self::Neighbors<'_>

impl<A, T> VertexMap<T> for GridGraph<A>

where Self: Graph<Vertex = (usize, usize)>,

type Vmap = Vec<T>

fn construct_vmap<F>(&self, f: F) -> Self::Vmap

where F: FnMut() -> T,

fn vmap_get<'a>(&self, map: &'a Self::Vmap, (x, y): Self::Vertex) -> &'a T

fn vmap_get_mut<'a>( &self, map: &'a mut Self::Vmap, (x, y): Self::Vertex, ) -> &'a mut T

fn vmap_set(&self, map: &mut Self::Vmap, vertex: Self::Vertex, value: T)