I've got a graph that I need to collect information from several vertex to a root vertex (i.e.each one possible disjoint tree). The number of vertex to the head is user-defined and can be calculated but it can also be differently defined for each tree which makes it a pain to use a select. There is only one unique path to a root vertex (i.e. each vertex can only have one parent).
I was hoping to use "traverse in(<link>) from [ <starting nodes> ]" which gives me all the nodes but doesn't give me the needed information to reconstruct each full path if any path intersects a previously traversed one. I'd prefer to have a single query rather than a query per path. I'm sure I'm missing something but couldn't find anything in the wiki to help. If I can get the node's parent rid in each traversed record that would be super. Any ideas would be appreciated. -- --- You received this message because you are subscribed to the Google Groups "OrientDB" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. For more options, visit https://groups.google.com/d/optout.
