an the size of the graph,
the algorithm will use quadratic space; if the value is 1 linear space will be used.</p>
<p>The default value is NaN, which will attempt to find a good value based on the number of nodes and links
in each connected subgraph.</p>
</div></li></ul></section><section class="tsd-panel tsd-member"><a id="prelayoutSpread" class="tsd-anchor"></a><h3 class="tsd-anchor-link"><span>prelayout<wbr/>Spread</span><div class="membertype"><span class="tsd-signature-symbol">: </span><span class="tsd