Help Center/ Graph Engine Service/ User Guide/ Algorithms/ Filtered Shortest Path
Updated on 2022-09-15 GMT+08:00
View PDF

Filtered Shortest Path

Overview

The Filtered Shortest Path algorithm is used to search for the shortest path that meets the filtering criteria between two vertices. If there are multiple shortest paths, any one of them is returned.

Application Scenarios

This algorithm applies to path design and network planning. It generates the shortest path based on vertex and edge filtering criteria.

Parameter Description

Table 1 Filtered Shortest Path algorithm parameters

Parameter

Mandatory

Type

Description

source

Yes

String

Enter the source vertex ID of a path.

target

Yes

String

Enter the target vertex ID of a path.

directed

No

Boolean

Whether to consider the edge direction The default value is false.

Precautions

This algorithm only returns one shortest path.

Parent topic: Algorithms