I'm building a graph with many nodes, around 3000. I wrote a simple python program to do the trick with graphviz, but it gives me segmentation fault and I don't know why, if the graph is too big or if i'm missing something.

The code is:

#!/usr/bin/env python# Import graphviz
import sys
sys.path.append('..')
sys.path.append('/usr/lib/graphviz')
import gv# Import pygraph
from pygraph.classes.graph import graph
from pygraph.classes.digraph import digraph
from pygraph.algorithms.searching import breadth_first_search
from pygraph.readwrite.dot import write# Graph creation
gr = graph()file = open('nodes.dat', 'r')
line = file.readline()
while line:gr.add_nodes([line[0:-1]])line = file.readline()file.close()
print 'nodes finished, beginning edges'edges = open('edges_ok.dat', 'r')
edge = edges.readline()
while edge:gr.add_edge((edge.split()[0], edge.split()[1]))edge = edges.readline()edges.close()
print 'edges finished'
print 'Drawing'# Draw as PNG
dot = write(gr)
gvv = gv.readstring(dot)
gv.layout(gvv,'dot')
gv.render(gvv,'svg','graph.svg')

and it crashes at the gv.layout() call.

The files are somthing like: nodes:

   node1node2node3

edges_ok:

   node1 node2node2 node3

I changed the layout type from dot to neato and that solved the problem.

I searched a bit and it seems that the dot layout is a bit faulty on large graphs.