The “Shortest Path Filter” is designed to reduce the “hair-ball” effect in the network visualization. The goal is to extract a minimally connected subgraph, by computing pair-wise shortest paths between all major hub nodes, and then remove the nodes that are not on the shortest paths.