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: 311
Unique Edges: 311
Edges With Duplicates: 0
Total Edges: 311
Self-Loops: 1
Reciprocated Vertex Pair Ratio: 0
Reciprocated Edge Ratio: 0
Connected Components: 1
Single-Vertex Connected Components: 0
Maximum Vertices in a Connected Component: 311
Maximum Edges in a Connected Component: 311
Maximum Geodesic Distance (Diameter): 2
Average Geodesic Distance: 1.987159
Graph Density: 0.00321543408360129
Modularity: 0.001605
NodeXL Version: 1.0.1.441