Incorrect lower & upper bound on element pattern with WHERE and bounded path-finding

[Dtenwolde]

Test in shortest_path.test

-FROM GRAPH_TABLE (snb
	MATCH p = ANY SHORTEST (a:Person where a.name = 'Daniel')-[k:knows]->{2,3}(b:Person)
	COLUMNS(element_id(p), a.name, b.name)

Potential cause: The lower and upper bounds are 1 & 1 because the previous element pattern is seen as a Subpath because of the filter.

Another query where this goes wrong

-FROM GRAPH_TABLE (pg
    MATCH
    p = ANY SHORTEST (a:Person)-[k:knows]->{2,3}(b:Person)
    COLUMNS (path_length(p), element_id(p), a.name as name, b.name as b_name)
    ) study
    order by study.name, study.b_name;

[github-actions]

This issue has been automatically marked as stale because it has not had recent activity. It will be closed if no further activity occurs. Thank you for your contributions.

[github-actions]

This issue has been automatically marked as stale because it has not had recent activity. It will be closed if no further activity occurs. Thank you for your contributions.