Skip to content

Fix subgraph_all() config parameters descriptions #1333

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 2 commits into from
Jul 16, 2025
Merged
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
6 changes: 2 additions & 4 deletions pages/advanced-algorithms/available-algorithms/path.mdx
Original file line number Diff line number Diff line change
Expand Up @@ -377,10 +377,8 @@ If subgraph is not specified, the algorithm is computed on the entire graph by d
|- |- |- |- |
| minHops | Int | 0 | The minimum number of hops in the traversal. Set to `0` if the start node should be included in the subgraph, or `1` otherwise. |
| maxHops | Int | -1 | The maximum number of hops in the traversal. |
| relationshipFilter | List | [ ] | List of relationships which the subgraph formation will follow. Relationships
can be filtered using the notation described below. |
| labelFilter | List | [ ] | List of labels which will define filtering. Labels
can be filtered using the notation described below. |
| relationshipFilter | List | [ ] | List of relationships which the subgraph formation will follow. Relationships can be filtered using the notation described below. |
| labelFilter | List | [ ] | List of labels which will define filtering. Labels can be filtered using the notation described below. |
| filterStartNode | Bool | False | Whether the `labelFilter` applies to the start nodes. |

**Relationship filters:**
Expand Down