Guest

March 05, 2021

The graph was imported from the open workbook "AWS_edgelist.csv".

The graph is undirected.

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 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: 1179
Unique Edges: 2800
Edges With Duplicates: 0
Total Edges: 2800
Self-Loops: 0
Reciprocated Vertex Pair Ratio: Not Applicable
Reciprocated Edge Ratio: Not Applicable
Connected Components: 1
Single-Vertex Connected Components: 0
Maximum Vertices in a Connected Component: 1179
Maximum Edges in a Connected Component: 2800
Maximum Geodesic Distance (Diameter): 8
Average Geodesic Distance: 3.241571
Graph Density: 0.00403207806103126
Modularity: 0.129534
NodeXL Version: 1.0.1.444