The Weighted algorithm calculates links and places objects in groups from largest to smallest based on the number of objects in the group. The objects in each group are arranged in a hierarchical fashion using the most heavily connected object as the root.

This placements works well for small clusters of data.

This Weighted example shows the concentrations of associations within the datasource data set. The largest groupings are shown first.