Voters make better lovers! Login and vote now.
By bloid
via nodebox.net
Submitted: Mar 14 2008 / 05:02
The NodeBox Graph library includes algorithms from NetworkX for betweenness centrality and eigenvector centrality, Connelly Barnes' implementation of Dijksta shortest paths (here) and the spring layout for JavaScript by Aslak Hellesoy and Dave Hoover (here). The goal of this library is visualization of small graphs (<200 elements), if you need something more robust we recommend using NetworkX.
SaveShareSend
Tags: frameworks, python
Comments
Ryan Ginstrom replied ago:
Impressive -- simple API and stunning graphics.
Voters For This Link (2)
Voters Against This Link (0)