questions:

1/ So for the "filter that applies to visits that return nodes one by one" part, we are talking about: neighbors, walk, visit/nodes only?
2/ the filter is a query parameter I guess?

In T2981#63164, @Hakimb wrote:

questions:

1/ So for the "filter that applies to visits that return nodes one by one" part, we are talking about: neighbors, walk, visit/nodes only?

there's also /leaves

with "walk" you probably meant /randomwalk, which is indeed another one

2/ the filter is a query parameter I guess?

yes. Regarding naming, I propose something like "return_nodes=:node_types" (in theory "nodes" would be non ambiguous, because filtering during traversal is currently possible only filtering on edges, but that might change in the future, so better be explicit with "return" in the parameter name)

I just want to write something here that maybe isn't clear from the initial task description. This filtering must happen *after* the visit, not during. We can already change *how* the graph is visited using the edges parameter, the goal of this task is to filter the result post-visit.