I am trying to render a graph containing about 4000
vertices and 7000 edges using the FRLayout. However,
the rendering of such a graph is very slow. Can JUNG
handle graphs of this size? If so, would you have
some suggestions for faster rendering of such graphs?
Darrell Berry
2006-06-16
Logged In: YES
user_id=1501213
how slow is 'slow'? what spec machine are you using?
Joshua O'Madadhain
2006-06-25
Joshua O'Madadhain
2006-06-25
Logged In: YES
user_id=709417
FRLayout is an O(n^2) algorithm; as such it will be pretty slow on graphs of
this size. (This is characteristic of most of the simple layout algorithms for
general graphs.) JUNG can easily handle graphs of this size--I've used it to
work with graphs a few hundred times this size--but running O(n^2)
algorithms on them (several hundred times in succession, which is what
FRLayout does!) is less feasible.
Your options are basically as follows:
(1) Visualize a smaller subgraph. (Personally I find it hard to get much out of
a graph of that size, unless you've got a _huge_ display.)
(2) Implement a more efficient layout algorithm (check the literature).
Joshua