A better visualisation of large attractors

[daemontus]

If there is a hypercube of states, and all the states within that hypercube are independently reachable between each other (i.e. without leaving the hypercube: the hypercube is strongly connected), then "compress" that hypercube into one node in the attractor graph.

Question is how should this be detected (it probably isn't a unique representation, i.e. there could be different overlapping hypercubes).