3 ms·
I want a graph that keeps an order on the edges, e.g., (A, B, C) being nodes, the graph {(A,B), (A,C), (A,C)} differs from the graph {(A,C), (A,B), (A,C)}. In
by thyrsus 14y ago
I want a graph that keeps an order on the edges, e.g., (A, B, C) being nodes, the graph {(A,B), (A,C), (A,C)} differs from the graph {(A,C), (A,B), (A,C)}. In other words, the outgoing edges are a list, not a set. Where can I find discussion of how to do that efficiently?
- espeed 14y agoStore a property on the edges for the order and use Gremlin to sort/filter by the order property. See the Gremlin docs: https://github.com/tinkerpop/gremlin/wiki https://github.com/tinkerpop/gremlin/wiki