Resource Allocation is used to compute the closeness of nodes based on their shared neighbors. It is computed by the following formula:
Where š(š¢) is the set of nodes adjacent to u.
Suppose we have the following graph:
Since Dan and Jenny has one shared neighbor Tom
, who has two neighbors, running the algorithm between Dan and Jenny with friendship edges would give us a result of 0.5.
Name
Description
Data type
a
A vertex.
VERTEX
b
A vertex.
VERTEX
e_type
Edge types to traverse.
SET<STRING>