This chapter describes the hierachical drawing method by Sugiyama et. al. ( SugiyamaLayout). It is best suited for directed graphs, where all (or most) edges in the drawing shall run in the same direction (e.g., downward).
The method works in three steps. Each step is modelled as a submodule in SugiyamaLayout. Possible implementations can be found in chapters Chapter Rank Assignment, Chapter Two Layer Crossing Minimization, and Chapter Layout of Hierarchies.
© Copyright 1998-2001, Algorithmic Solutions Software GmbH. All rights reserved.
2001-08-13