Help Center/ Graph Engine Service/ User Guide/ Algorithms/ Filtered All Shortest Paths
Updated on 2024-01-03 GMT+08:00
View PDF

Filtered All Shortest Paths

Overview

The Filtered All Shortest Paths algorithm allows you to search query results of the Shortest Path algorithm for the paths that meet the conditions between two vertices in a graph.

Application Scenarios

This algorithm applies to scenarios such as relationship mining, path planing, and network planning.

Parameter Description

Table 1 Filtered All Shortest Paths algorithm parameters

Parameter

Mandatory

Description

Type

Value Range

Default Value

source

Yes

Source vertex ID

String

-

-

target

Yes

Target vertex ID

String

-

-

directed

No

Whether an edge is directed

Bool

The value can be true or false.

false

Example

Configure the parameters as follows: directed=true, source="Alice", target="Jay", and set the search condition to labelName=friends. The results are returned in JSON format.

Parent topic: Algorithms