Layout behavior with partitioned graph


What is the behavior of the force directed layout algorithm when the graph is partitioned (there are N subgraphs graphs that are not linked to each other)?


All of the GoLayoutNetworkNodes (i.e. the nodes in a GoLayoutNetwork) influence each other according to the values determined by the methods of GoLayoutForceDirected.
If you want to treat them separately, you’ll need to perform separate layouts for each subgraph, and then move them where you want them.