Guest

October 30, 2020

The graph is directed.

The graph's vertices were grouped by cluster using the Clauset-Newman-Moore cluster algorithm.

The graph was laid out using the Harel-Koren Fast Multiscale layout algorithm.

The edge colors are based on edge weight values. The edge widths are based on edge weight values. The edge opacities are based on edge weight values.

Overall Graph Metrics:
Vertices: 413
Unique Edges: 17846
Edges With Duplicates: 0
Total Edges: 17846
Self-Loops: 281
Reciprocated Vertex Pair Ratio: 0
Reciprocated Edge Ratio: 0
Connected Components: 1
Single-Vertex Connected Components: 0
Maximum Vertices in a Connected Component: 413
Maximum Edges in a Connected Component: 17846
Maximum Geodesic Distance (Diameter): 4
Average Geodesic Distance: 1.832689
Graph Density: 0.103228801805402
Modularity: 0.07036
NodeXL Version: 1.0.1.441