The All Graphs command of the Algorithms menu creates a planar hexagonal adjacency graph for the current project by executing all possible combinations of graph algorithm settings and retaining the adjacency graph with the highest adjacency score. In other words, it runs four relationship tuple times three improvement steps times two tie breakers for a total of 24 algorithms. For each combination of options the algorithm is run for the maximum number of iterations. The best adjacency graph is retained and displayed at the conclusion of the algorithm. Because of its extensive computations this command might take a long time to complete.