Zainab-Saad opened a new issue, #730: URL: https://github.com/apache/age/issues/730
If I have a scenario in which there are three vertices A, B and C. Going from A -> B takes cost 2 and then B -> C takes cost 3. If I have to go from A -> C, I can query on the variable length edge using `()-[e:label*]->()`. But this would return the path and if we get all the intermediate edges by `relationships(p)`, we get list of edges. How do we sum the cost 2 and 3 here from this list of edges? -- 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: [email protected] For queries about this service, please contact Infrastructure at: [email protected]
