Hi - I am currently working on a twitter like application with orient db, where users can follow eachother (one directional relationship). I am trying to find a good way to get the shortest path between two vertices one directionally. In other words, if I have users A, B, C and A follows B who follows C who follows A (but not the other way around), I am looking for something that will tell me that the shortest path from A to C is A->B->C , and not A->C.
I tried using the shortestpath() function but it seems agnostic to direction and returns the same results no matter which vertex is passed as first argument. Does anyone know of a good way to do this? Thanks -- --- 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.
