Layout of compound directed graphs

We present a method for the layout of compound directed graphs that is based on the hierarchical layer layout method. Our method has similarities with the method of Sugiyama and Misue (IEEE Trans. Sys., Man, Cybernetics, 21(4), pp. 876-892, 1991) but gives different results: It uses a global partitioning into layers and tries to produce placements of nodes such that border rectangles can be drawn around the nodes of each subgraph. The method is implemented in the VCG tool

Drawing Graphs within Restricted Area

We study the problem of selecting a maximum-weight subgraph of a given graph such that the subgraph can be drawn within a prescribed drawing area subject to given non-uniform vertex sizes. We develop and analyze heuristics both for the general (undirected) case and for the use case of (directed) calculation graphs which are used to analyze the typical mistakes that high school students make when transforming mathematical expressions in the process of calculating, for example, sums of fractions

Drawing Layered Hypergraphs

Orthogonally drawn hypergraphs have important applications, e.g. in actor-oriented data flow diagrams for modeling complex software systems. Graph drawing algorithms based on the approach by Sugiyama et al. place nodes into consecutive layers and try to minimize the number of edge crossings by finding suitable orderings of the nodes in each layer. With orthogonal hyperedges, however, the exact number of crossings is not determined until the edges are actually routed in a later phase of the algorithm, which makes it hard to evaluate the quality of a given node ordering beforehand. In this report, we present and evaluate two crossing counting algorithms that predict the number of crossings between orthogonally routed hyperedges much more accurately than previous methods. We also describe methods for routing hyperedges that span multiple layers and for handling junction points

Layout of compound directed graphs

We present a method for the layout of compound directed graphs that is based on the hierarchical layer layout method. Our method has similarities with the method of Sugiyama and Misue (IEEE Trans. Sys., Man, Cybernetics, 21(4), pp. 876-892, 1991) but gives different results: It uses a global partitioning into layers and tries to produce placements of nodes such that border rectangles can be drawn around the nodes of each subgraph. The method is implemented in the VCG tool

A Generalization of the Directed Graph Layering Problem

The Directed Layering Problem (DLP) solves a step of the widely used layer-based layout approach to automatically draw directed acyclic graphs. To cater for cyclic graphs, classically a preprocessing step is used that solves the Feedback Arc Set Problem (FASP)to make the graph acyclic before a layering is determined. Here, we present the Generalized Layering Problem (GLP) which solves the combination of DLP and FASP simultaneously, allowing general graphs as input. We show GLP to be NP- complete, present integer programming models to solve it, and perform thorough evaluations on different sets of graphs and with different implementations for the steps of the layer- based approach. We observe that GLP reduces the number of dummy nodes significantly, can produce more compact drawings and improves on graphs where DLP yields poor aspect ratios

Graph layout for applications in compiler construction

We address graph visualization from the viewpoint of compiler construction. Most data structures in compilers are large, dense graphs such as annotated control flow graph, syntax trees, dependency graphs. Our main focus is the animation and interactive exploration of these graphs. Fast layout heuristics and powerful browsing methods are needed. We give a survey of layout heuristics for general directed and undirected graphs and present the browsing facilities that help to manage large structured graph

Automatic Layout of Data Flow Diagrams in KIELER and Ptolemy II

Data flow diagrams are successfully applied in the area of model-based design of complex embedded systems. However, their creation and maintenance can be very time-consuming, because many tools offer little support for the editing and visualization of graphical models. The KIELER project explores new concepts for the pragmatics of graphical modeling and develops algorithms for automatic layout of specific classes of diagrams. These concepts and algorithms are implemented as extensions of the Eclipse framework, which offers generic approaches to create IDEs for graphical modeling. We have developed a specialized layout algorithm for data flow diagrams. In addition to the embedding in KIELER, we applied this algorithm to Ptolemy, a framework for research on models of computation for use in embedded systems. The results show that our algorithm is well suited for the actor oriented diagrams of Ptolemy, and it can serve as a basis to facilitate the editing of Ptolemy diagrams

Graph layout for applications in compiler construction

We address graph visualization from the viewpoint of compiler construction. Most data structures in compilers are large, dense graphs such as annotated control flow graph, syntax trees, dependency graphs. Our main focus is the animation and interactive exploration of these graphs. Fast layout heuristics and powerful browsing methods are needed. We give a survey of layout heuristics for general directed and undirected graphs and present the browsing facilities that help to manage large structured graph