SSSP
Overview
The SSSP algorithm finds the shortest paths from a specified node (source node) to all other nodes.
Application Scenarios
This algorithm applies to scenarios such as path design and network planning.
Parameter Description
| 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 |
Example
Calculate the shortest paths from the Lee node to other nodes.
Set parameters source to Lee and directed to true.
Parent topic: Algorithms
Last Article: Filtered Shortest Path
Next Article: Shortest Path of Vertex Sets
Did this article solve your problem?
Thank you for your score！Your feedback would help us improve the website.