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: 187
Unique Edges: 1456
Edges With Duplicates: 0
Total Edges: 1456
Self-Loops: 77
Reciprocated Vertex Pair Ratio: 0
Reciprocated Edge Ratio: 0
Connected Components: 1
Single-Vertex Connected Components: 0
Maximum Vertices in a Connected Component: 187
Maximum Edges in a Connected Component: 1456
Maximum Geodesic Distance (Diameter): 5
Average Geodesic Distance: 2.21785
Graph Density: 0.0396469438215169
Modularity: 0.179453
NodeXL Version: 1.0.1.441