Network Diagram

Neither layout is a simulation. Clusters are the two eigenvectors of the normalised graph Laplacian just above the trivial one, which is the exact answer to the problem a spring layout approaches by shaking. Nobody told it about the four groups in the legend of your head; it separated them from the traffic numbers alone. Hops is a breadth-first tree with each subtree given a wedge worth its leaf count. Both land on the same pixels every run. Drag any node to pull it clear, or hold Shift and use the arrow keys: two services sitting on top of each other means the layout found their neighbourhoods near identical, and it is still you who has to read it. A moved node keeps a dashed outline and the link underneath puts everything back, so what the layout said is never lost. On hops, a node slides around its own ring and no further, because there the radius is the number of hops and dragging across rings would be editing the data rather than the view.