chessboard0.1 package

Create Network Connections Based on Chess Moves

append_edge_lists

Append several edge lists

append_matrix

Combine several connectivity matrices

bishop

Find neighbors according to bishop movement

bishop_left

Find neighbors according to bishop left movement

bishop_right

Find neighbors according to bishop right movement

chessboard-package

chessboard: Create Network Connections Based on Chess Moves

connectivity_matrix

Create a connectivity matrix from an edge list

create_edge_list

Create an edge list

create_node_labels

Create unique node labels

distance_euclidean

Compute the pairwise Euclidean distance

edges_to_sf

Convert edge list to spatial object

edges_weights_matrix

Create an edges weights matrix

edges_weights_vector

Create an edges weights vector

fool

Find neighbors according to fool movement

geom_edges

Link neighbors by arrow on a chessboard

geom_neighbors

Highlight neighbors on a chessboard

geom_node

Highlight a node on a chessboard

get_node_list

Get the list of nodes

gg_chessboard

Plot a sampling as a chessboard

gg_matrix

Plot a connectivity or a nodes-by-edges matrix

knight

Find neighbors according to knight movement

knight_left

Find neighbors according to knight left movement

knight_right

Find neighbors according to knight right movement

matrix_to_edge_list

Convert an connectivity matrix to an edge list

nodes_by_edges_matrix

Create a nodes-by-edges matrix

pawn

Find neighbors according to pawn movement

pipe

Pipe operator

queen

Find neighbors according to queen movement

rook

Find neighbors according to rook movement

spatial_weights_matrix

Create a spatial weights matrix

wizard

Find neighbors according to wizard movement

Provides functions to work with directed (asymmetric) and undirected (symmetric) spatial networks. It makes the creation of connectivity matrices easier, i.e. a binary matrix of dimension n x n, where n is the number of nodes (sampling units) indicating the presence (1) or the absence (0) of an edge (link) between pairs of nodes. Different network objects can be produced by 'chessboard': node list, neighbor list, edge list, connectivity matrix. It can also produce objects that will be used later in Moran's Eigenvector Maps (Dray et al. (2006) <doi:10.1016/j.ecolmodel.2006.02.015>) and Asymetric Eigenvector Maps (Blanchet et al. (2008) <doi:10.1016/j.ecolmodel.2008.04.001>), methods available in the package 'adespatial' (Dray et al. (2023) <https://CRAN.R-project.org/package=adespatial>). This work is part of the FRB-CESAB working group Bridge <https://www.fondationbiodiversite.fr/en/the-frb-in-action/programs-and-projects/le-cesab/bridge/>.

  • Maintainer: Nicolas Casajus
  • License: GPL (>= 2)
  • Last published: 2023-10-14