Guest

September 21, 2021

The graph is directed.

The graph's vertices were grouped by cluster using the Girvan-Newman cluster algorithm.

The graph was laid out using the Harel-Koren Fast Multiscale layout algorithm.

The edge widths are based on edge weight values. The edge opacities are based on edge weight values.

Overall Graph Metrics:
Vertices: 6
Unique Edges: 11
Edges With Duplicates: 0
Total Edges: 11
Self-Loops: 1
Reciprocated Vertex Pair Ratio: 1
Reciprocated Edge Ratio: 1
Connected Components: 1
Single-Vertex Connected Components: 0
Maximum Vertices in a Connected Component: 6
Maximum Edges in a Connected Component: 11
Maximum Geodesic Distance (Diameter): 2
Average Geodesic Distance: 1.388889
Graph Density: 0.333333333333333
Modularity: 0.200413
NodeXL Version: 1.0.1.447