Assembly Sequence Planning for Rectangular Modular Robots with Accessibility Constraints

Algorithm 3

deleteBranch (G, s).

1: Remove s from G.Tree[parent(s)]

2: While G.Tree[s] is not empty do

3:  Pop the first element w from G.Tree[s]

4:  Mark w as undiscovered

5:  deleteBranch (G, w)