a shortest path tree is initialized by adding first a node, for example node v, representing the root with a signal stack containing the signal requested to be routed.
The shortest path tree is updated to include new nodes meeting the desired routing constraints.