rng_graph: Relative neighbor graph

In Issamfalih/MUNA: MUNA: A Multiplex Network Analysis Library

Description

the relative neighborhood graph (RNG) is an undirected graph defined on a set of points in the Euclidean plane by connecting two points p and q by an edge whenever there does not exist a third point r that is closer to both p and q than they are to each other

Usage

rng_graph(dx,names,similarity)

Arguments

dx	: matrix that express the similarity or distance between elements i and j
names	: the names of vertex in the new graph
similarity	: if TRUE then dx is a similarity matrix else it is a distance matrix

Value

returns the relative neighborhood graph (RNG) defined over the similarity/Distance matrix dx

Author(s)

Issam Falih <[e-mail]>

Examples

d <-  dist(iris)
rng_graph(as.matrix(d))

Issamfalih/MUNA documentation built on May 8, 2019, 11:52 a.m.