FrancescoSillani opened a new issue, #1464: URL: https://github.com/apache/age/issues/1464
Hello all, I have the following (simplified) scenario: A -> [R] -> B B -> [R] -> C where A, B, C are vertex of my graph, and R is a relation. With the following query: MATCH p = (t1)-[R*]->(t2) the following paths are returned: A -> B, B->C, A -> B -> C Is it possible to build a query that returns only the following path: A -> B -> C? I was thinking about - adding a WHERE clause similar to "WHERE not t2 -> [R] -> ()" - adding a MATCH similar to "MATCH NOT (p1 = (t2)-[R]->())" but I'm not able to obtain a valid query... Could you please me give any advice? Thanx a lot in advance -- This is an automated message from the Apache Git Service. To respond to the message, please log on to GitHub and use the URL above to go to the specific comment. To unsubscribe, e-mail: dev-unsubscr...@age.apache.org.apache.org For queries about this service, please contact Infrastructure at: us...@infra.apache.org
