Visualizing a DAG

graph visualization data-visualization directed-acyclic-graphs graph-visualization
mikera picture mikera · Aug 19, 2010 · Viewed 10.6k times · Source

I have a large directed acyclic graph that I would like to visualize in a bitmap image.

Ideally I'd like to have all the root nodes at the top of the image, and all of the leaf nodes at the bottom, i.e. the graph edges are all pointing in a downwards direction.

Is there a good algorithm for working out the coordinates of all the nodes that meets these constraints and will produce a good visualization?

Answer

Guillaume Lebourgeois picture Guillaume Lebourgeois · Aug 19, 2010

I advise you to use Gephi.

This soft is able to do all the things you want to, especially graph layouts !

Related questions

Is there a better color scale than the "rainbow" colormap?

I am plotting a series of curves in x, y space, where each curve is identified by a scalar value z. I wish to map the z value to color for each line, but most colormaps / color tables are constructed …

Read More
What's the fastest force-directed network graph engine for large data sets?

We currently have a dynamically updated network graph with around 1,500 nodes and 2,000 edges. It's ever-growing. Our current layout engine uses Prefuse - the force directed layout in particular - and it takes about 10 minutes with a hefty server to get …

Read More
How do you change the size of figures drawn with matplotlib?

How do you change the size of figure drawn with matplotlib?

Read More