Hi Robert, technicaly there is none. You can use an edge collection in the context of a graph, then its a graph edge collection. Have a look at:
https://docs.arangodb.com/Graphs/index.html Cheers, Willi On Monday, June 13, 2016 at 6:30:34 AM UTC+2, Robert wrote: > > Okay, I'll give this a bump by asking some more specific questions. After > slogging through some of the basics of using the ArangoJS driver, I've been > able to construct a basic genealogy tree. But I'm still struggling > especially with edges. > > Let's just take it piece by piece. > > What, for example, is the difference between a graphedgecollection and > just an edgecollection? > > > > On Wednesday, June 8, 2016 at 11:01:55 PM UTC-4, Robert wrote: >> >> Hi all. I'm new to ArangoDB. I've studied up on graphs and the basics of >> how they work, but I'm still new enough to not quite get a simple formula. >> (I'm also using the Node.js driver, for what it's worth.) >> >> My scenario is a basic tree, child to parents relationship, as a >> genealogy/family history tree. So, starting with a child, parents, >> grandparents, g-grandparents, and so forth. >> >> Let's say I start with any given individual in the tree, but I only want >> to traverse UP the tree (getting parents, grandparents, etc) and NOT >> children, spouses, siblings, etc. So basically, not traverse other edges, >> but only traverse "UP" or "_to" parents. >> >> How would this kind of filtered traversal look? >> >> Thanks. >> > -- 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.
