If the choice of the layout algorithm is hard-coded,
but the layout must be performed at run time because the graphs are
not known at programming time, one possible step-by-step procedure
for the choice of the appropriate layout algorithm can be:
-
Look at sample graphs for your domain.
-
Try to determine some generalities about the properties of the structure and the size of the graph (Is the graph cyclic? Is the graph a tree? Is the graph a combination of the two? What is the number of nodes and links in the graph?)
-
Pick an appropriate layout algorithm.
-
Try out the algorithm on one or more samples.