Filtered All Shortest Paths

Overview

The Filtered All Shortest Paths algorithm allows you to search query results of the Shortest Path algorithm for the paths that meet the conditions between two vertices in a graph.

Application Scenarios

This algorithm applies to scenarios such as relationship mining, path planing, and network planning.

Parameter Description

**Table 1** Parameters
Name	Mandatory	Description	Type	Value Range	Default
source	Yes	Source vertex ID	String	-	-
target	Yes	Target vertex ID	String	-	-
directed	No	Whether the edges are directed	Bool	The value can be true or false.	false

Example

Configure the parameters as follows: directed=true, source="Alice", target="Jay", and set the search condition to labelName=friends. The results are returned in JSON format.

Parent topic: Algorithms

Previous topic: Filtered All Pairs Shortest Paths

Next topic: TopicRank