Hi all, I'm using the OTraverse class, in the Java API, to traverse some links that are stored in a hierarchy of nodes with maps containing RIDs. For such, I employ the depth-first algorithm mode, but I did not find a way to determine the order of the traversal. Right now, those aforementioned maps use an int, as keys, and the algorithm is visiting the RIDs with the smallest keys first, but for my use case I want exactly the contrary. The algorithm has to be depth-first, but the RIDs with the biggest keys must be visited first. Anybody know how to solve that in the Java API?
Regards, Lucas Lira Gomes. -- --- 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.
