Filtered All Pairs Shortest Paths
Parameter | Mandatory | Description | Type | Value Range | Default Value |
|---|---|---|---|---|---|
sources | Yes | Set of start vertex IDs. The value is in the standard CSV input format, that is, multiple vertex IDs are separated by commas (,). | String | The number of source vertices cannot exceed 10,000. | - |
targets | Yes | Set of end vertex IDs. The value is in the standard CSV input format, that is, multiple vertex IDs are separated by commas (,). | String | The number of target vertices cannot exceed 10,000. | - |
directed | No | Whether an edge is directed | Boolean | The value can be true or false. | false |
cutoff | No | Maximum length | Integer | 1-100 | 6 |
path_limit | No | Maximum number of paths | Integer |
The value ranges from 1 to 100000. The default value is 100000.
The value ranges from 1 to 1000000. The default value is 1000000. | 100000/1000000 |
- Synchronous tasks: Number of source vertices x Number of target vertices x Maximum path length (cutoff) <= 1000000, Maximum number of paths (path_num) x Maximum path length (cutoff) <= 1000000.
- This algorithm checks memory capacity. When the memory is insufficient, the error "memory is not enough" is reported.
Parameter | Type | Description |
|---|---|---|
batch_paths | List | Batch paths. Format: [paths_element,...] where Paths_element indicates the path from a source to a target. The format is as follows: { "paths": [ [ "Alice", "Janet", "Sue", "Serena", "Bonnie" ] ], "source": "Alice", "target": "Bonnie" }, |
paths_number | Integer | Number of paths |