adjacency: Dissimilarity matrix based on connectivity information.

View source: R/perioclust.R

adjacencyR Documentation

Dissimilarity matrix based on connectivity information.

Description

From the data of a network, we build a contiguity matrix. Based on this matrix, we generate a dissimilarity matrix. The matrix contains only 0 or 1, 1 if there is no relationship and 0 if there is a relationship. The network object is a data frame with two columns. The first column contains the elements of the network and the second column contains a list of all other elements related to it. The list is a string consisting of the names of the elements separated by commas (see example).

Usage

adjacency(network)

Arguments

network

Data frame with 2 columns. The first contains all elements (nodes) and the second a string with all related elements (links).

Value

D

Dissimilarity matrix based on adjacency.

Author(s)

A. COULON

L. BELLANGER

P. HUSI

Examples

##---- Should be DIRECTLY executable !! ----
##-- ==>  Define data, use random,
##--  or do  help(data=index)  for the standard data sets.
library(SPARTAAS)
data(datangkor)

## network stratigraphic data (Network)
network <- datangkor$stratigraphy

dissimilarity <- adjacency(network)
dissimilarity

SPARTAAS documentation built on June 27, 2024, 5:06 p.m.