The Common Neighbors algorithm calculates the number of common neighbors between two vertices.
The number of common neighbors between two vertices.
Suppose to have the following graph:
Running the algorithm between Dan and Jenny will show that they have 1 common neighbor:
Name
Description
Data type
a
A vertex.
VERTEX
b
A vertex.
VERTEX
e_type
Edge types to traverse.
SET<STRING>