The inspected root, which adds no segment.
The node to identify, the root or beneath it.
Optionalfrontiers: Map<Optional memo of each ancestor's named frontier, valid while the graph is unchanged.
The node's identity, unique among the nodes beneath root.
The unique inspection identity of a displayed node beneath
root.Named nodes form a
/-joined name path, asautoMovieInspectionPathOfreads it, so unnamed wrapper groups add no segment. Among the named nodes that share the same nearest named ancestor (or the root), a name held by more than one becomesname#k, withkthe node's 0-based order among them in depth-first child order. Unnamed nodes below the nearest named ancestor append.children[i], their index in the parent, and a node with no named ancestor starts fromscene. With unique names and named nodes the result equalsautoMovieInspectionPathOf.A caller naming many nodes of one unchanged graph passes one
frontiersmap to all calls, so each ancestor's frontier is scanned once; a graph that changes between calls needs a fresh map.