In continuation of a discussion related to a linkedlist serving as a workable array where each hop depth represents an index that can be ordered:
CYPHER store order of node relationships of the same label when I create
Cypher Linked LIst: how to unshift and replace by index
Cypher LinkedList Match by index but "Don't know how to compare that." instead
I have recently been trying to capture a report on each array that belong to a parent node. This report includes a unique relationshiptype and a count of how many elements are in the linked list array:
[
{
reltype : "123A_RelationshipTitleOne",
depthcount : 5
}, {
reltype : "123A_RelationshipTitleTwo",
depthcount : 9
}, {
reltype : "123A_RelationshipTitleThree",
depthcount : 42
}
]
Cypher -Tally report on the depth of each relationship type stemming from parent node
We are close to a solution but the query time is very slow and the count amount is double its expected value.
On stackoverflow we have documented queries for array-like features of a linkedlist including unshift at the beginning, insert at index, replace at index, and push at the end of the "array"
I'm hoping for help on also the array length feature
I am very grateful for help you can offer.