When using the Graph Layout package, you need to determine which of the ready-to-use layout algorithms is appropriate for your particular needs. Some layout algorithms can handle a wide range of graphs. Others are designed for particular classes of graphs and will give poor results or will reject graphs that do not belong to these classes. For example, a Tree Layout algorithm is designed for tree graphs, but not cyclic graphs. Therefore, it is important to lay out a graph using the appropriate layout algorithm.

Table 4.1 can help you determine which of the layout algorithms is best suited for a particular type of graph. Across the top of the table are various classifications of different types of graphs. The layout algorithms appear on the left side of the table. By identifying some the general characteristics of the graph you want to lay out, you can see from the table whether a layout algorithm is suited for that particular type of graph. The illustrations in the table cells provide an example of the drawing produced when a layout algorithm is applied to a particular type of graph. For example, if you know that the structure of the graph is a tree, you can look at the Domain-Independent Graphs/Trees column to see which layout algorithms are appropriate. The Tree Layout, Hierarchical Layout, and Orthogonal Link Layout could all be used. Use the illustrations in the table cells to help you further narrow your choice.