GoDigram for .NET Framework and .NET Core
Northwoods.Go.Layout Namespace / GoLayoutForceDirected Class / ArrangeConnectedGraphs Method
an IEnumerator iterating over a number of GoLayoutForceDirectedNetwork, each containing a connected graph; this is the result of calling Northwoods.Go.Layout.GoLayoutGenericNetwork`3.SplitIntoSubNetworks``1
a GoLayoutForceDirectedNetwork containing only unconnected individual nodes
In This Topic
    ArrangeConnectedGraphs Method
    In This Topic
    During a clustered layout, position each separate graph network so that they do not overlap each other.
    Syntax

    Parameters

    subnets
    an IEnumerator iterating over a number of GoLayoutForceDirectedNetwork, each containing a connected graph; this is the result of calling Northwoods.Go.Layout.GoLayoutGenericNetwork`3.SplitIntoSubNetworks``1
    singletons
    a GoLayoutForceDirectedNetwork containing only unconnected individual nodes
    Remarks

    There may be separate component graphs (without any links between them) within the original network. The subnets enumerator will iterate over a number of GoLayoutForceDirectedNetworks, each containing a connected (sub)graph. If the original network is connected, i.e. if there is at least one path of undirected links from each node in the original Network to every other node, then there will be only a single GoLayoutForceDirectedNetwork for the enumerator, and the singletons network will be empty.

    This method places each separately-laid-out graph in different non-overlapping locations. By default this ignores IsFixed, because it may move "fixed" nodes to ensure disconnected subgraphs do not overlap.

    See Also