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: 359
Unique Edges: 4641
Edges With Duplicates: 0
Total Edges: 4641
Self-Loops: 20
Reciprocated Vertex Pair Ratio: 0.546002007360321
Reciprocated Edge Ratio: 0.706340618913655
Connected Components: 1
Single-Vertex Connected Components: 0
Maximum Vertices in a Connected Component: 359
Maximum Edges in a Connected Component: 4641
Maximum Geodesic Distance (Diameter): 4
Average Geodesic Distance: 2.005074
Graph Density: 0.0359549337856554
Modularity: 0.113384
NodeXL Version: 1.0.1.441