anvaka / ngraph.native

C++ implementation of force-based layout from ngraph
MIT License
51 stars 28 forks source link

Maximum graph size #1

Closed davidcmh closed 9 years ago

davidcmh commented 9 years ago

Hi Andrei, I am currently doing a academic project on graph visualization and I am planning to implement force-directed layout on multiple large graph datasets. Just wondering, what is the biggest graph you have tried processing with this C++ algorithm? What do you think is its limit?

Cheers, David

anvaka commented 9 years ago

4 million nodes, 30+ million edges was the largest so far.

Have you looked at sfdp from graphviz? I know in theory it can layout hundreds of millions nodes graph (yet I couldn't get it to work on one million nodes on practice, but probably I was doing something wrong)