Same Community

Overview

The Same Community algorithm checks whether two nodes belong to the same weakly connected component. It is a simple link prediction indicator — nodes in the same component are more likely to be connected or have a relationship.

Considerations

• The algorithm treats all edges as undirected (weakly connected components).

Example Graph

GQL
INSERT (A:default {_id: "A"}), (B:default {_id: "B"}),
       (C:default {_id: "C"}), (D:default {_id: "D"}),
       (E:default {_id: "E"}), (F:default {_id: "F"}),
       (G:default {_id: "G"}), (A)-[:default]->(B),
       (B)-[:default]->(E), (C)-[:default]->(B),
       (C)-[:default]->(D), (C)-[:default]->(F),
       (D)-[:default]->(B), (D)-[:default]->(E),
       (F)-[:default]->(D)

Parameters

Run Mode

Returns:

GQL
CALL algo.samecommunity({
  node1: "A",
  node2: "G"
}) YIELD node1, node2, sameCommunity

Result:

Stream Mode

Returns the same columns as run mode, streamed for memory efficiency.

GQL
CALL algo.samecommunity.stream({
  node1: "A",
  node2: "G"
}) YIELD node1, node2, sameCommunity
RETURN node1, node2, sameCommunity

Result:

Stats Mode

Returns:

GQL
CALL algo.samecommunity.stats({
  node1: "A",
  node2: "G"
}) YIELD sameCommunity

Result: