You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
This is an interesting point which I've though a lot about.
The initial, instinctive idea is to think of the relationships as uni-directional vectors. So, it can be either:
A->B
B->A, or...
(both) A<->B.
However, many well-know Graph databases, pretty much eliminate the need for such distinction.
So, in that sense (not that it's final - I'm still open to counter-arguments), I decided to make all links direction-agnostic. What is missing is a direction-agnostic search.
In a few words, the way the database is set up right now, A->B, automatically infers the opposite relationship.
What is not possible so far is to search this relationship in both directions (but is something that can be easily implement and I will included it soon...)
@MichaelCMcCann arturo-lang/arturo#23
The text was updated successfully, but these errors were encountered: