We changed our privacy policy. Read more.

New answers tagged

3

The formal definition of a clique is a fully connected subgraph (or cliquiness=1.0 in your example) where the shortest path between all the nodes in the clique is 1. To relax that, you have use the n-clique where the shortest path to all nodes is n or less. If you're looking at "in-follow" vs "out-follow", a simple ratio of k_in / k_out ...


Top 50 recent answers are included