Applying Filtering
Our first node-link diagram looked quite cluttered.
There were many nodes with only one or two connections, but we're more interested in the nodes with more conenctions, so let's apply some filtering.
| |
We apply two transforms, to calculate the degree of every node, and then remove any node with a degree of 2 or less. |
|
|