Help Center/ Graph Engine Service/ User Guide/ Algorithms/ Filtered Shortest Path

Updated on 2022-04-14 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

Previous topic: All Shortest Paths

Next topic: SSSP

Feedback

Was this page helpful?

Helpful Not helpful

Provide feedback

Thank you very much for your feedback. We will continue working to improve the documentation.See the reply and handling status in My Cloud VOC.

The system is busy. Please try again later.

Which of the following issues have you encountered?

Content is inconsistent with the product UI

Unclear descriptions

Lack of examples or code

Incorrect steps

Can't find what I need

Lack of best practices

Feedback (optional)

0/500

Select at least one type of issue, and enter your comments or suggestions.

Enter a maximum of 500 characters.

Submit Cancel

For any further questions, feel free to contact us through the chatbot.