How about getting past 50000? -:)shooltz wrote: I was able to get past 15000 without significant slowdowns. However, the Network.addNode method (or rather the wrapped C++ method) performs the check for the uniqueness of the node identifier by linearly comparing the new id with all existing ids, so you can expect addNode taking more time as you add nodes.
That's certainly gets too slow. You can get somewhat better perf using shorter prefix for node identifiers ("n" instead of "node").bill wrote:How about getting past 50000? -:)
Such internal flag exists and is used to disable checking during .xdsl load (the O(nlogn) check is done on the completion of the load). You may try creating arc-less network with required node count once, saving it to the file and loading it later - it may be faster.OK, I see; that explains it... would be nice to have an option (Boolean flag) for disabling this linear checking -:).
Yes, now it is faster... I guess that in a real case network where each node will have a "significantly" different name this would be even faster.shooltz wrote: That's certainly gets too slow. You can get somewhat better perf using shorter prefix for node identifiers ("n" instead of "node").
OK, I understandshooltz wrote: Such internal flag exists and is used to disable checking during .xdsl load (the O(nlogn) check is done on the completion of the load). You may try creating arc-less network with required node count once, saving it to the file and loading it later - it may be faster.
. But it would be nice to enable this (or a similar) flag during node addition as well. That is because the network might not have a static representation.