#TO AND FROM GRAPH IN ARANGODB HOW TO#
Long, short, I'd just like to know how to run my query to find the path from node to leaf. Is there a correct way to do this in AQL? Is there a document that shows how to do what steemann does in his article, but only using AQL? Is there some great AQL documentation on graph queries other than what is on the arangodb site (all of which I have already read, including the graph presentation and the udemy course)? If not, I would be happy to write something to share with the community, but I am not sure yet how to do this myself, so I'd need some pointers to material that can get me started. The traversal objects looked like they supplied a solution to this issue, but it seems they are now deprecated. I find that I always get every sub-path and would then have to do some post-processing. I would like to write an AQL query that returns the single 'longest' path from the starting node to the leaf node. Where a is the edge type, and x,y,z are the nodes.
In particular, I have a graph where a given node has a single path (via a certain 'type' of edge) from that node to a leaf. I read ( ) and ( ), since they always popped up when searching for what I am trying to do. I am new to Arango and I am trying to understand the 'right' way to write some queries.
0 kommentar(er)
