edgeScanKNearest: edgeScanKNearest

In friendlycities-gatech/SSNtools: What the Package Does (One Line, Title Case)

edgeScanKNearest

Description

calculate number of edges for each independent node in a graph in a range of k nearest nodes

Usage

edgeScanKNearest(nodes, edges, k, weighted = FALSE, bipartite = FALSE)

Arguments

nodes	nodes of graph (a list of named lists)
edges	edges of graph (a list of lists)
k	number of nodes in search window
weighted	(optional) boolean value of whether a weighted column has been included.
bipartite	(optional) boolean value of whether the data is a bipartite network

Value

a list of two dataframes. The first R datafrmae contains a column of node label, and a column of heat associated with the node. The second R dataframe contains the edge pairs and a boolean column indicating whether the edge is within the scanning window.

Examples

## Not run: 
edgeScanKNearest(nodes, edges, 5)

## End(Not run)

friendlycities-gatech/SSNtools documentation built on Sept. 13, 2023, 10:40 a.m.