Guest

October 21, 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 vertex sizes are based on degree values. The vertex opacities are based on degree values.

Overall Graph Metrics:
Vertices: 17
Unique Edges: 151
Edges With Duplicates: 0
Total Edges: 151
Self-Loops: 17
Reciprocated Vertex Pair Ratio: 0
Reciprocated Edge Ratio: 0
Connected Components: 1
Single-Vertex Connected Components: 0
Maximum Vertices in a Connected Component: 17
Maximum Edges in a Connected Component: 151
Maximum Geodesic Distance (Diameter): 2
Average Geodesic Distance: 0.955017
Graph Density: 0.492647058823529
Modularity: 0.053123
NodeXL Version: 1.0.1.441