As shown in Figure (IV), the fourth step is determining the number of non-connected components in the candidate's final graph. It is common for these components to arise from subsystems either distant from one another or moving quickly enough to prevent them from forming stable edges. If the can-didate for the final graph has no separate components, it is considered the final graph. At this point, one can proceed directly to the search for its automorphisms.