Possible Duplicate:
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 a nice, stable layout.
I've looked a little GraphViz's sfpd algorithm, but haven't tested it yet...
Are there faster alternatives I should look at?
- I don't care about the visual appearance of the nodes and edges - we process that separately - just putting
x, y
on the nodes. - We do need to be able to tinker with the layout properties for specific parts of the graph, for instance, applying special tighter or looser springs for certain nodes.
- Bonus credit for stats/benchmarks!
Thanks in advance, and please comment if you need more specific information to answer!