New function "partition" to deliver a skeleton arbor as a sequence
of sequences of IDs, with the largest sequence running from the
furthest end node to the root node, then from each end node until
reaching a node that has been seen, etc. Each sequence has the node
IDs in order from end node to nearest to root or root.
Function implementing tree node centrality by synapse as O(2n),
as formulated by Casey Schneider-Mizell.
Each node of the tree representing a neuronal arbor gets as
score the number of paths from an input synapse to an output synapse
that cross that node.
Fixed declaration of member variables of class Counts
Address issues with the review system, namely the lack of coordination
between the 'e' and the 'w' functionality. 'e' must be queued after
'w' has finished updating the entire table.
For this purpose I created a "submit" function that ensures
concatenation of continuations by invoking a request at the end
of the handler function for the continuation of the previous one.
Search window: list the index of the result row, on both sides.
And remove Gerhard's leftover console.log message.
Merge branch 'synapse-risk'