Description:

The graph is directed.b The graph was laid out using the Fruchterman-Reingold layout algorithm. Edges between clusters are combined and shown with thickness coded edges showing numbers of edges.

Overall Graph Metrics:

Vertices: 104

Unique Edges: 671

Edges With Duplicates: 0

Total Edges: 671

Self-Loops: 55

Connected Components: 2

Single-Vertex Connected Components: 1

Maximum Vertices in a Connected Component: 103

Maximum Edges in a Connected Component: 670

Maximum Geodesic Distance (Diameter): 4

Average Geodesic Distance: 2.231291

Graph Density: 0.0575056011949216

Modularity: Not Applicable

The vertex colors are based on clusters identified authomatically. The graph's vertices were grouped by cluster using the Clauset-Newman-Moore cluster algorithm (assumes undirected edges).

The vertex sizes are based on followers values.