ForceAtlas2 v0.1
First release
A port of Gephi’s Force Atlas 2 layout algorithm to Python 2 and Python 3 (with a wrapper for NetworkX). This is the fastest Python implementation available with most of the features complete. It also supports Barnes Hut approximation for maximum speedup.
ForceAtlas2 algorithm is really fast compared to the Fruchterman Reingold algorithm (spring layout) of NetworkX and scales well to a high number of nodes (>10000).