All Shortest Paths
Overview
The All Shortest Paths algorithm is used to find all shortest paths between two nodes in a graph.
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 | Enter the source ID of a path. | String | - | - |
| target | Yes | Enter the target ID of a path. | String | - | - |
| directed | No | Whether to consider the edge direction | Bool | true or false | false |
Precautions
None
Example
Set parameters source to Lee, target to Alice, and directed to false. The calculation result is displayed on the canvas and the JSON result is displayed in the query result area.
Parent topic: Algorithms
Last Article: Shortest Path
Next Article: Filtered Shortest Path
Did this article solve your problem?
Thank you for your score！Your feedback would help us improve the website.