The NodeBox Graph library includes algorithms from NetworkX for betweenness centrality and eigenvector centrality, Connelly Barnes’ implementation of Dijksta shortest paths and the spring layout for JavaScript by Aslak Hellesoy and Dave Hoover. The goal of this library is visualization of small graphs (<200 elements)