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

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

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

Example

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

Set parameters source to Lee and directed to true.