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

Question

We currently have a dynamically updated network graph with around 1,500 nodes and 2,000 edges. It\'s ever-growing. Our current layout en

Answer 1

In a commercial scenario, you might also want to look at the family of yFiles graph layout and visualization libraries.

Even the JavaScript version of it can perform layouts for thousands of nodes and edges using different arrangement styles. The "organic" layout style is an implementation of a force directed layout algorithm similar in nature to the one used in Neo4j's browser application. But there are a lot more layout algorithms available that can give better visualizations for certain types of graph structures and diagrams. Depending on the settings and structure of the problem, some of the algorithms take only seconds, while more complex implementations can also bring your JavaScript engine to its knees. The Java and .net based variants still perform quite a bit better, as of today, but the JavaScript engines are catching up.

You can play with these algorithms and settings in this online demo.

^{Disclaimer: I work for yWorks, which is the maker of these libraries, but I do not represent my employer on SO.}