Gephi forums •best and fastest based-force algorithm for large trees

[phpBB Debug] PHP Warning: in file [ROOT]/phpbb/session.php on line 583: sizeof(): Parameter must be an array or an object that implements Countable
[phpBB Debug] PHP Warning: in file [ROOT]/phpbb/session.php on line 639: sizeof(): Parameter must be an array or an object that implements Countable
[phpBB Debug] PHP Warning: in file [ROOT]/includes/functions.php on line 4516: Cannot modify header information - headers already sent by (output started at [ROOT]/includes/functions.php:3262)
[phpBB Debug] PHP Warning: in file [ROOT]/includes/functions.php on line 4516: Cannot modify header information - headers already sent by (output started at [ROOT]/includes/functions.php:3262)
[phpBB Debug] PHP Warning: in file [ROOT]/includes/functions.php on line 4516: Cannot modify header information - headers already sent by (output started at [ROOT]/includes/functions.php:3262)
Gephi forums •best and fastest based-force algorithm for large trees

Page 1 of 1

best and fastest based-force algorithm for large trees

Posted: 14 Aug 2013 13:36

by cheibia

Hello,

1) What is the algorithm which is the best and the fastest to visualize a big tree (with 1 million nodes for example)?
Actually, I look for an algorithm that give a result like this in the link below (here in Javascript):
http://www-igm.univ-mlv.fr/~dr/XPOSE201 ... html#gephi

2) Can Force Atlas 2 or OpenOrd or Parallel Force Atlas do that?

thank you in advance.