I'm asking specifically for traversal. Not for shortest path. Weight would GREATLY help here. I can't really get more detailed then that.
On Wednesday, January 31, 2018 at 3:42:39 PM UTC-5, CoDEmanX wrote: > > The AQL shortest path traversal can take weights stored in the edge > documents into account: > > https://docs.arangodb.com/3.3/AQL/Graphs/ShortestPath.html#syntax > > I'm unsure what it would do in normal / pattern matching traversals if it > was supported. I mean, a regular traversal will return all matching paths. > In how far would a weight help here? If you want to return certain type of > friends more than others, can't you do some post-calculation, sort, limit > and return certain nodes? > -- You received this message because you are subscribed to the Google Groups "ArangoDB" group. To unsubscribe from this group and stop receiving emails from it, send an email to arangodb+unsubscr...@googlegroups.com. For more options, visit https://groups.google.com/d/optout.
