| Download Gephi | Blog | Gephi Store | Wiki | Forum | Support | Bugtracker

Look for Gephi Plugins

Popular Keywords

Close Search

DAG Layout

DAG Layout
5 votes, 5.00 avg. rating (97% score)


Simple Layout for directed acyclic graphs (DAGs).

Plugin Owner’s Notes

The nodes are arranged in discrete layers so that the edges will always point downwards (if no loop exists). The nodes are arranged as far to the top as possible, minimizing the number of layers used. The horizontal layout is done by assigning the nodes to discrete slots in each layer (the biggest layer defines the number of availabe slots for each layer). While running, slots are chosen randomly and swapped if this would make the edges shorter to generate a more compact graph. These optimizations are only local and will not generate an overall opimal layout.

Expected input:

DAG (directed acyclic graph, a directed grah without loops)
If the graph contains loops, it is treated as a DAG as far as possible and all “leftover” edges are ignored. Which edges in circles are ignored may be different on each run because of the randomization in the initialization phase.

Known issues:

Sometimes, the layout refuses to optimize the order of the nodes in the layers. Restart gephi in this case.

Similar Plugins

Architectural GraphML

This plugin is developed as part of the “KSD research group”, where the German Research Center for Artificial Intelligence GmbH (DFKI), University of Kaiserslautern and the Technische Universität München (TUM) take part. “During the design process architects and students often study the plans of buildings that have already been built or designed. Such information is [...]

More Info


This layout uses an isometric perspective to visualize networks. I.e. it generates 3D coordinates for all network nodes (x,y,z). Thus, is a method for the visual representation of three-dimensional nodes in two dimensions. It can be used to split a network into distinct Z-Layers (e.g. to better visualize high-performers and/or low-performers, or communities after using [...]

More Info


The GC-Viz plugin contains the algorithms GAMer and DB-CSC for the clustering of graphs with node attributes. It also contains a layout for visualizing and comparing the clustering results. The plugin has been developed by Brigitte Boden, Roman Haag and Houran Ketabdar. The plugin is described in the following paper: Brigitte Boden, Roman Haag, and [...]

More Info