This PR introduces "skip nodes". These are nodes that are not expanded, but instead "skip" the rest of the succession diagram and lead to some of the child spaces further down in the succession diagram (by default, these are minimal trap spaces). To preserve the correctness of other methods, it is required that each skip node still has successors that cover every minimal trap space relevant for that skip node (this is mainly to ensure that we don't detect the attractors in minimal trap spaces multiple times).
This makes it possible to stop the expansion at a particular SD size and run attractor detection that uses all available information, even if the SD is incomplete.
This PR introduces "skip nodes". These are nodes that are not expanded, but instead "skip" the rest of the succession diagram and lead to some of the child spaces further down in the succession diagram (by default, these are minimal trap spaces). To preserve the correctness of other methods, it is required that each skip node still has successors that cover every minimal trap space relevant for that skip node (this is mainly to ensure that we don't detect the attractors in minimal trap spaces multiple times).
This makes it possible to stop the expansion at a particular SD size and run attractor detection that uses all available information, even if the SD is incomplete.