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