8 Jun
2013
8 Jun
'13
11:49 p.m.
n log(n) sounds quite good for this kind of algorithm. But, what does n mean? Is it the
amount of nodes, or the amount of edges as well?
Doru
On Jun 7, 2013, at 6:18 PM, Alexandre Bergel <alexandre.bergel(a)me.com> wrote:
Hi Mathieu,
We will have a look at this asap
Alexandre
On Jun 7, 2013, at 9:19 AM, mathieubmddehouck(a)mailoo.org wrote:
--
www.tudorgirba.com
"We cannot reach the flow of things unless we let go."
Hi
I've made some tests on the force based layout, and it seems it has really a
complexity in nlog(n) (and we cannot do really better).
Thus when you take 3 seconds to compute a layout with 100 nodes, then it's normal to
take 40 seconds with 1000 nodes.
Regards
Mathieu
_______________________________________________
Moose-dev mailing list
Moose-dev(a)iam.unibe.ch
https://www.iam.unibe.ch/mailman/listinfo/moose-dev
--
_,.;:~^~:;._,.;:~^~:;._,.;:~^~:;._,.;:~^~:;._,.;:
Alexandre Bergel http://www.bergel.eu
^~:;._,.;:~^~:;._,.;:~^~:;._,.;:~^~:;._,.;:~^~:;.
_______________________________________________
Moose-dev mailing list
Moose-dev(a)iam.unibe.ch
https://www.iam.unibe.ch/mailman/listinfo/moose-dev