Help Center> Graph Engine Service> User Guide> Algorithms> K-core
View PDF

K-core

Overview

K-core is a classic graph algorithm used to calculate the number of cores of each node. The calculation result is one of the most commonly used reference values for determining the importance of a node so that the propagation capability of the node can be better understood.

Application Scenarios

This algorithm applies to scenarios such as community discovery and finance risk control.

Parameter Description

Table 1 K-core algorithm parameters

Parameter

Mandatory

Description

Type

Value Range

Default Value

k

Yes

Number of cores

The algorithm returns nodes whose number of cores is greater than or equal to k.

Int

Greater than or equal to 0

-

Precautions

None

Example

Set parameter k to 10. The sub-graph formed by nodes whose number of cores is greater than or equal to 10 in the calculation result is displayed on the canvas. The color of a node varies with the number of cores. The JSON result is displayed in the query result area.

Parent topic: Algorithms