Forceatlas2 Versions Save

Fastest Gephi's ForceAtlas2 graph layout algorithm implemented for Python and NetworkX

v0.3.5

5 years ago

Changelog

  • Add igraph wrapper
  • Fixes ZeroDivisionError for graph with small number of nodes

v0.3.4

5 years ago

Changelog (v0.3 and v0.3.4)

  • Fix rendering of README.md on the PyPi project page
  • Updated setup.py file. Rebuild .c file if Cython is present
  • Use the pre-generated .c file if Cython is not installed
  • README.rst to README.md
  • Example python notebook added

v0.3

5 years ago

Changelog

  • Updated setup.py file. Rebuild .c file if Cython is present
  • Use the pre-generated .c file if Cython is not installed
  • README.rst to README.md
  • example python notebook added

v0.2

6 years ago

Changelog

  • Major changes in setup.py
  • Fixed python2 compatibility
  • MANIFEST file to include fa2/fa2util.c and fa2/fa2util.pxd files
  • Updated README

v0.1

6 years ago

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).