Help Center> Graph Engine Service> User Guide> Algorithms> n-Paths
View PDF

n-Paths

Overview

The n-Paths algorithm is used to find the n paths between two nodes within the layers of relationships in a graph.

Application Scenarios

This algorithm applies to scenarios such as relationship analysis, path design, and network planning.

Parameter Description

Table 1 n-Paths algorithm parameters

Parameter

Mandatory

Description

Type

Value Range

Default Value

source

Yes

Enter the source ID of a path.

String

-

-

target

Yes

Enter the target ID of a path.

String

-

-

directed

No

Whether to consider the edge direction

Bool

true or false

false

n

No

Number of paths

Int

1-100

10

k

No

Number of hops

Int

1-10

5

Example

Set parameters source to Lee, target to Alice, n to 10, k to 5, and directed to false. The calculation result is displayed on the canvas and the JSON result is displayed in the query result area.

Parent topic: Algorithms