Arrangement Series Depth Hierarchy Level Counter
Resolve caller actual parent-index forest depth with explicit roots and cycle refusal, no inference of archival arrangement from a flat count; bounded to one million parent traversals.
Description
An archival hierarchy can contain several root collections and nested children.
An archival hierarchy can contain several root collections and nested children. Parent indices define the actual structure; counting flat records cannot reveal hierarchy depth.1
Resolve caller actual parent-index forest depth with explicit roots and cycle refusal, no inference of archival arrangement from a flat count; bounded to one million parent traversals.
When to use Arrangement Series Depth Hierarchy Level Counter
Use this tool to resolve caller actual parent-index forest depth with explicit roots and cycle refusal, no inference of archival arrangement from a flat count; bounded to one million parent traversals.
Prepare the inventory, measurements or policy dates for the collection and reporting period. Confirm units, record order and any independently established thresholds or permissions.
How to use Arrangement Series Depth Hierarchy Level Counter and understand its results
- Prepare the inventory, measurements or policy dates for the collection and reporting period. Confirm units, record order and any independently established thresholds or permissions.
- Enter parentNodeIndices using the field table and calculation rules, then run the tool.
- Read nodeDepthsRootAtZero, maximumHierarchyDepth, rootNodeCount. The explanation below defines the units, signs, ordering and any flags or placeholder values.
- If the tool reports an input issue, correct the values and run it again. Apply the stated assumptions when interpreting a successfully returned result.
| Input field | Meaning | Value type; see rules below | Requirement |
|---|---|---|---|
| parentNodeIndices | Parent node indices | list of number | Required |
Enter 1–1,000 parent indices, each a safe integer from −1 to the final node index. −1 identifies a root. For each node the tool follows parents until a root, rejecting self-links and longer cycles. Return depths in input order, maximum depth and root count.
root depth = 0; child depth = parent depth + 1 Units, indexing, boundary conditions and exceptional cases are defined in the calculation rules above.
| Output field | Meaning | Value type |
|---|---|---|
| nodeDepthsRootAtZero | Node depths root at zero | list of number |
| maximumHierarchyDepth | Maximum hierarchy depth | number |
| rootNodeCount | Root node count | number |
{
"input": {
"parentNodeIndices": [
-1,
0,
1,
0
]
},
"output": {
"nodeDepthsRootAtZero": [
0,
1,
2,
1
],
"maximumHierarchyDepth": 2,
"rootNodeCount": 1
}
} Limitations and assumptions
The input defines a forest rather than a single mandatory root. The tool does not infer arrangement or validate archival level names. Invalid indices and cycles are input errors, not depth results.
Numeric inputs must be finite. Follow the calculation-specific rules for overflow, underflow and exceptional cases. Numeric lists are limited to 100,000 entries; the rules above may require smaller limits. Missing required fields, extra fields, wrong value types and violations of the calculation rules are input errors.
Alternative or Complementary methods
Use Harris Matrix Depth Order Checker: Topologically audit supplied older-to-younger Harris relations, reporting measured positive-down depth contradictions without overwriting stratigraphy; input order breaks ties and cycles error. For a complementary task, use Original Order Preservation Deviation Flag Checker: Audit actual original/current matched stable identities through displacements and pair inversions, rather than infer archival integrity from moved count; missing/duplicate identity is unresolved, not accepted.
References
Similar or alternative tools
- Harris Matrix Depth Order Checker
Topologically audit supplied older-to-younger Harris relations, reporting measured positive-down depth contradictions without overwriting stratigraphy; input order breaks ties and cycles error.
- Original Order Preservation Deviation Flag Checker
Audit actual original/current matched stable identities through displacements and pair inversions, rather than infer archival integrity from moved count; missing/duplicate identity is unresolved, not accepted.