I should add that I'm not really looking for the shortest path. I'm looking for all paths from one to the other.
On Monday, January 29, 2018 at 2:10:32 PM UTC-5, R S wrote: > > I'm just not wrapping my brain around Arango. I've had the docs open over > and over. I'm hoping someone can start me off in the right direction. > > > Let's say you simply want to create a "6 degrees of kevin bacon" > connectedness tool. All it does is you type in 2 people's names and it > tells you how they are connected. > > I'm assuming you'd create: > -Data Collection with _key, firstname, lastname, etc. Lets simply call > that DataCollection > -Edge Collection with _to & _from. Let's just call this EdgeCollection. > > Then you'd create a graph with your edge collections > > My 2 questions are: > > -When setting up the graph would you put EdgeCollection for all > "EdgeDefinition", "fromCollection", and "toCollection"? Or just "Edge > Definition"? > > -Once the graph is built, what is a simple AQL statement to connect 2 > people? > > > I know this is very basic! But once I understand this, I'm certain I can > sort out the rest. > > Thank you! > -- 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.
