Learn R Programming

spatgraphs (version 3.4)

Graph Edge Computations for Spatial Point Patterns

Description

Graphs (or networks) and graph component calculations for spatial locations in 1D, 2D, 3D etc.

Copy Link

Version

Install

install.packages('spatgraphs')

Monthly Downloads

212

Version

3.4

License

GPL (>= 2)

Maintainer

Tuomas Rajala

Last Published

February 10th, 2023

Functions in spatgraphs (3.4)

spatcluster

Compute the connected components of a graph
sparse2sg

Make an sg-object from adjacency matrix
print.sg

Print method for sg
sg2wadj

weighted sg to weighted adjacency matrix
sg_parse_coordinates

Parse input for coordinates
weight_sg

Set weights to edges of sg
remove_nodes

Remove edges connected to certain nodes
sg_verify_parameters

Verify input parameters for the graph
t.sg

Transpose sg object
t.sgadj

Transpose sgadj object
shortestPath

shortest path on the graph
print.sgadj

print method for sgadj
spectral_sg

spectral clustering
spatgraph

Compute the edges of a spatial graph
summary.sg

sg summary
summary.sgc

sgc summary
sg2sym

Symmetrisation of sg adjacency matrix wrapper for 1way and 2way symmetrisation
sg2sparse

Make a sparse adjacency matrix from sg-object
sg2adj

sg to sgadj
as.sgadj

Creator for sgadj-class
plot.sgc

plot clusters
as.sgc

Creator for sgc
adj2sg

sgadj to sg
as.sg

Class creator
plot.sgadj

plot sgadj
cut.sg

cut edges
edgeLengths

Edge lengths
plot.sg

Plot a spatial graph
is_sg

verify class sg
plot.sgspectral

plot spectral clustering results
print.sgc

sgc print method
prune_sg

Prune a graph
sg2igraph

sg to igraph
sg2dxf

sg to dxf format
plot3_sg

Plot 3d graph