[jgrapht-users] Memory on Centrality

[Jeff G <jef...@gm...>]

I ran into a memory issue when trying to calculate betweenness centrality on
my graphs.  I'm using a simple graph - is there a better way for efficient
memory usage?  I was using JUNG and it worked fine for computing centrality,
using an UndirectedSparseGraph().  Is there an equivalent in jGraphT that I
should be using so I don't run out of memory?

Thanks,
Jeff