Guest

October 24, 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: 11
Unique Edges: 46
Edges With Duplicates: 0
Total Edges: 46
Self-Loops: 0
Reciprocated Vertex Pair Ratio: 0
Reciprocated Edge Ratio: 0
Connected Components: 1
Single-Vertex Connected Components: 0
Maximum Vertices in a Connected Component: 11
Maximum Edges in a Connected Component: 46
Maximum Geodesic Distance (Diameter): 2
Average Geodesic Distance: 1.057851
Graph Density: 0.418181818181818
Modularity: 0.013233
NodeXL Version: 1.0.1.441