The more or less same question has been asked recently on StackOverflow,
but no answer so far.
http://stackoverflow.com/questions/43209765/orientdb-eficcient-way-to-find-all-shortest-path-between-to-vertex-with-proper
Anyone?
Am Freitag, 21. April 2017 17:34:32 UTC+2 schrieb Jean-Marc Autexier:
>
> Hi,
>
> I'm trying to implement an algorithm to get all shortest path between 2
> nodes in Gremlin 2.6/OrientDB 2.2.
>
> The following statement does more or less what I need, but it returns only
> the nodes, but I need both nodes and edges of all paths:
>
> g.v(srcid).both.loop(1){it.loops<10 && ! it.object.equals(g.v(dstId))
> }{it.object.equals(g.v(dstId))}.simplePath.path
>
> How can I do this?
>
> br,
> Jean-Marc
>
--
---
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.
