Guest

September 23, 2019

The graph is undirected.

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.

Overall Graph Metrics:
Vertices: 158
Unique Edges: 302
Edges With Duplicates: 0
Total Edges: 302
Self-Loops: 0
Reciprocated Vertex Pair Ratio: Not Applicable
Reciprocated Edge Ratio: Not Applicable
Connected Components: 4
Single-Vertex Connected Components: 0
Maximum Vertices in a Connected Component: 120
Maximum Edges in a Connected Component: 252
Maximum Geodesic Distance (Diameter): 9
Average Geodesic Distance: 3.945799
Graph Density: 0.0243489478352012
Modularity: 0.731426
NodeXL Version: 1.0.1.419