Guest

September 23, 2019

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: 172
Unique Edges: 154
Edges With Duplicates: 0
Total Edges: 154
Self-Loops: 0
Reciprocated Vertex Pair Ratio: 0
Reciprocated Edge Ratio: 0
Connected Components: 18
Single-Vertex Connected Components: 0
Maximum Vertices in a Connected Component: 27
Maximum Edges in a Connected Component: 26
Maximum Geodesic Distance (Diameter): 2
Average Geodesic Distance: 1.763597
Graph Density: 0.0052359581123351
Modularity: 0.897453
NodeXL Version: 1.0.1.419