Rank Assignment

Rank assignment modules are used by hierarchical layout algorithms (i.e., SugiyamaLayout) for distributing vertices on level (the level i to which a vertex belongs is called its rank).

Since edges shall run in a common direction in hierarchical drawings, most rank assignment modules use a submodule for computing a maximal acyclic subgraph (see Chapter Chapter Subgraph Modules).