check: Check if a node an abstract graph is acceptable for inclusion...

In RoheLab/aPPR: Approximate Personalized PageRank

Check if a node an abstract graph is acceptable for inclusion in PPR

Description

Inclusion criteria:

Usage

check(graph, nodes)

Arguments

graph	A graph object.
nodes	The name(s) of node(s) in graph as a character vector.

Details

• At least one outgoing edge

• Can get in degree and out degree of node

• Can get all nodes connected to node / the 1-hop neighborhood

Value

The subset of nodes that are acceptable for inclusion. This can be a character vector of length zero if necessary. It is critical that no entries of nodes are duplicated in this output, so we recommend calling unique() if there is any potential for repeats in your checking good.

RoheLab/aPPR documentation built on July 1, 2024, 1:57 p.m.