Updated on 2024-01-03 GMT+08:00
Filtered n-Paths
Overview
The filtered n-Paths algorithm is used to find no more than n k-hop loop-free paths between the source and target vertices. The start vertex (source), end vertex (target), number of hops (k), number of paths (n), and filter criteria (filters) are the parameters for the algorithm.
Application Scenarios
Any network
Parameter Description
|
Parameter |
Mandatory |
Description |
Type |
Value Range |
Default Value |
|---|---|---|---|---|---|
|
source |
Yes |
Source vertex |
String |
Internal vertices |
None |
|
target |
Yes |
Target vertex |
String |
Internal vertices |
None |
|
k |
Yes |
Number of hops |
Int |
[2,6] |
2 |
|
n |
Yes |
Number of paths |
Int |
[1,1000] |
1 |
Parent topic: Algorithms
Feedback
Was this page helpful?
Provide feedbackThank you very much for your feedback. We will continue working to improve the documentation.
The system is busy. Please try again later.
