KIELER Project


Get me back to the home page!

Page tree

Versions Compared

Old Version 36

changes.mady.by.user Unknown User (uru)

Saved on

compared with

New Version 37

changes.mady.by.user Unknown User (cds)

Saved on

Key

  • This line was added.
  • This line was removed.
  • Formatting was changed.

...

Decides which algorithm is used to compute the y coordinate of each node. This influences the length of edges, the number of edge bends, and the height of the diagram. We have different algorithms available, with different optimization goals:

  • BRANDES_KOEPF
    Minimizes the number of edge bends at the expense of diagram size: diagrams drawn with this algorithm are usually higher than diagrams drawn with other algorithms.
  • LINEAR_SEGMENTS
    Computes a balanced placement.
  • BUCHHEIM_JUENGER_LEIPERT
    Also computes a balanced placement, but a little faster.
  • INTERACTIVE
    Tries to keep the preset y coordinates of nodes from the original layout. For dummy nodes, a guess is made to infer their coordinates. Requires the other interactive phase implementations to have run as well.
  • SIMPLE
    Minimizes the area at the expense of... well, pretty much everything else.

...