Edge cardinality SIMPLE documentation not clear
I am using edge cardinality as SIMPLE in my graph, and according to documentation:
SIMPLE: Allows at most one edge of such label between any pair of vertices. In other words, the graph is a simple graph with respect to the label. Ensures that edges are unique for a given label and pairs of vertices.
My question is, is direction considered here? Means can I have an edge A->B and B->A?
Or it ends up with SchemaViolationException2 Replies
@porunov can you help here, something critical? 🙂
I remember running an example test for the same question. If I remember correctly, direction does count and you can add one edge per direction: A->B and B->A, as by default you would be working with a directed graphs. This should also be quite easy to test on a small toy graph.