The All Graphs and Layouts command of the Algorithms menu creates a planar hexagonal adjacency graph for the current project by executing all possible combinations of graph algorithm settings. In other words its runs four relationship tuples times three improvement steps times two tie breakers for a total of 24 algorithms. For each combination of settings the algorithm is run for the maximum number of iterations. For each combination of graph algorithm settings all possible combinations of block layout algorithm settings are executed. In other words its runs three side orientations times five improvement steps time two space allocation methods for a total of 30 algorithms. The total number of combo algorithms is then 24 times 30 or 720 algorithms. The block layout with the lowest shape adjusted distance score is retained and displayed at the conclusion. Because of the extensive computations this command will take a very long time to complete.
The Tiled space allocation method is especially computation time intensive, and its execution can be disabled with the Execute All Graph and Layouts dialog window, which is illustrated below. When you press Yes all possible combinations of graph and layout algorithms will be executed. If you press No, no algorithm will be executed.
For more information see:
Execute All Graph and Layout Algorithms Dialog Window
Execute All Graph And Layout Algorithms Data Items