SSSP

Updated on 2022-09-15 GMT+08:00

View PDF

The SSSP algorithm finds the shortest paths from a specified node (source node) to all other nodes.

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

**Table 1** SSSP algorithm parameters
Parameter	Mandatory	Description	Type	Value Range	Default Value
source	Yes	Node ID	String	-	-
directed	No	Whether to consider the edge direction	Bool	true or false	true

Calculate the shortest paths from the Lee node to other nodes.

Set parameters source to Lee and directed to true.

Parent topic: Algorithms

Thank you very much for your feedback. We will continue working to improve the documentation.

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