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

Inclusion criteria:

check(graph, nodes)

Arguments

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

Value

The subset of nodes that are acceptable for inclusion. This can be a character vector of length zero if necessary.

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 neighbhorhood