4 in the classical
order, knowing a
node means you know the classical parent with
6 is given by
NODEB(
node) and the effect of the
node on the parent equation is
9 One major circumstance of the
multisplit order is that a parent child may
10 be reversed. For a single sid0,
this happens on the path between the classical
11 root and sid0. If a parent-child has been reversed and given a
node we know
12 the classical parent (presently a child) then at the
node
13 ClassicalB = ClassicalParentPresentA
14 ClassicalA = ClassicalParentPresentB
16 The other aspect of
multisplit, both sid0 and sid1 exist, is more complex
17 because of the
two parent nature of the
center node on the path between sid0
18 and sid1. Our convention is that v_parent[centernode->v_node_index] is toward
19 sid0. And the other parent is
20 v_parent[c2sid1_parent_index[centernode->v_node_index - backbone_center_begin]]
21 So we need to know what Classical A and B are
for the
center node and its
22 two parents. A
center node may be reversed or not with respect to its classical
23 parent. One of the present parents may or may not be its classical parent.
static double order(void *v)
double * nrn_classicalNodeA(Node *n)
double * nrn_classicalNodeB(Node *n)
static Node * node(Object *)
int const size_t const size_t n
static double multisplit(void *v)
