The algorithm calculates the total number of neighbors of two vertices.
CREATE QUERY tg_total_neighbors(VERTEX a, VERTEX b,
Edge types to traverse.
The total number of neighbors of two vertices.
Suppose we have the following graph.
Dan and Jenny together have 6 neighbors in total. Running the algorithm between Dan and Jenny would give us a result of 6. Note that since Jenny and Dan are neighbors themselves, the union of their neighbors includes both Jenny and Dan:
RUN QUERY tg_total_neighbors (("Jenny", "person"), ("Dan", "person"),