Help Center> Graph Engine Service> User Guide> Algorithms> Common Neighbors
View PDF

Common Neighbors

Overview

Common Neighbors is a basic graph analysis algorithm that obtains the neighboring nodes shared by two nodes and further speculate the potential relationship and similarity between the two nodes. For example, it can intuitively discover shared friends in social occasions or commodities that interest both nodes in the consumption field.

Application Scenarios

This algorithm applies to scenarios such as e-commerce and social networking.

Parameter Description

Table 1 Common Neighbors algorithm parameters

Parameter

Mandatory

Description

Type

Value Range

Default Value

source

Yes

Enter the source ID.

String

-

-

target

Yes

Enter the target ID.

String

-

-

Precautions

None

Example

Set parameters source to Lee and target to Alice. The calculation result is displayed on the canvas and the JSON result is displayed in the query result area.

Parent topic: Algorithms