Thanks very much Scott and Luca. Yes, indeed I am looking for something more like:
SELECT shortestPath(#8:32, #8:10, 'both', Workin.date="2010-05-01") Which would involve first selecting a graph (edges) that exist in a given date, and second obtaining the shortest path for that specific graph. I will write a function in Javascript as Luca suggests. Since I have so many dates the optimization is key. I will let you know what best solution I can find. Thanks a lot, and regards Ricardo Pasquini On Tuesday, November 24, 2015 at 9:27:55 AM UTC-3, l.garulli wrote: > > The only function that works out of the box is dijkstra(), otherwise you > could write your own function that is optimized for your case. you could > write it in Javascript under OrientDB Server function and then call it from > SQL: > > select myShortestPath(#8:32, #8:10, "2010-05-01") > > Best Regards, > > Luca Garulli > Founder & CEO > OrientDB <http://orientdb.com/> > > > On 23 November 2015 at 23:27, scott molinari <[email protected] > <javascript:>> wrote: > >> I believe Ricardo is looking for something like >> >> SELECT shortestPath(#8:32, #8:10) WHERE Workin = "2010-05-01" >> >> >> Scott >> >> -- >> >> --- >> 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] <javascript:>. >> For more options, visit https://groups.google.com/d/optout. >> > > -- --- 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.
