First, we present a simple strategy, suitable for beginners (but still powerful enough to cover several applications). Second, we show how to work if performance is more important than aesthetics. Third, we describe how to behave if aesthetics are more important than performance. Fourth, we show how several choices are available for constructing drawings that are more or less compact. Finally, we show how to customize the drawing according to your special requirements
If you want to construct an orthogonal drawing of a graph with BLAG, simply do the following:
Algorithm number 1 corresponds to the default algorithm for orthogonal drawings.
If performance is more important than aesthetics
Note: the current version of GDT allows to apply code 0 only to graphs that are biconnected and whose nodes have at most four incident edges. A graph is biconnected if the removal of one node is not sufficient to cut it into two (or more) disconnected pieces.
If aesthetics are more important than performance
Note: the current version of GDT allows to apply code 2 only to graphs that are biconnected. A graph is biconnected if the removal of one node is not sufficient to cut it into two (or more) disconnected pieces.
Note: code 2 causes the invocation of a branch and bound algorithm, that is potentially exponential in time requirement. This makes it unsuitable for graphs with more that 100 vertices.
As another example, if you want to emphasize an edge (say edge 8) that for some reason is expecially important, then you might want to preserve it to have crossings and maybe to have bends. This is done very easily by replacing the above configuration file with the following one.
We can choose to draw it orthogonally, with the constraint that node 8 has width=1 and height=1, and node 2 has width=1 and height=3. The lengths are in terms of integer grid points. If not constrained, each node has width=height=0.