Thanks for the reply!
I'm getting closer. Is it possible to use weight in a traverse, not a
shortest path?
FOR v,e,p
IN 1..4
ANY "entities/foo"
GRAPH "friendGraph"
OPTIONS {
bfs: true,
uniqueVertices: 'global',
weight: 'friendType'
}
FILTER v._id == "entities/bar"
RETURN p
On Monday, January 29, 2018 at 5:10:51 PM UTC-5, CoDEmanX wrote:
>
> If you're not after one shortest path, what you want is pattern matching.
> You traverse from a start node, up to a defined depth, with a filter for
> the end vertex.
>
> fromCollection and toCollection are meant as vertex collections, so
> DataCollection in your case for both.
>
> Check out our graph course:
> https://www.arangodb.com/arangodb-graph-course/
>
> How do you want to model connections between people? Using a single edge
> and ignore the direction? Or allow one-sided connections, honoring the edge
> direction?
>
--
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 [email protected].
For more options, visit https://groups.google.com/d/optout.
