You could use: OrientVertex v1 = ... OrientVertex v2 = ...
v1.getEdges( v2, Direction.OUT, "Likes" ) Lvc@ On 23 January 2014 18:41, Valentin Popov <[email protected]> wrote: > Luca hello > > Are available faster way to get Edge's between vertexes ? > > Regards > Valentin > > пятница, 13 сентября 2013 г., 0:10:20 UTC+4 пользователь Lvc@ написал: > >> On 12 September 2013 09:36, Pawan Goyal <[email protected]> wrote: >> >>> Hi, >>> >>> i have create 2 vertex v1 and v2.How can i check that a edge of friend >>> class exist between v1 and v2,so that duplicate edge are not created. >>> >> >> Iterable<Edge> edges = v1.getEdges( v2, Direction.OUT, "Friend" ); >> >> >>> 2nd question , >>> >>> Will graph.getVertices("User.fid", field); code use index created on >>> field fid for query. >>> >> >> Yes >> >> Lvc@ >> >> -- > > --- > 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/groups/opt_out. > -- --- 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/groups/opt_out.
