2001 - 副本.xlsx (experimental version)
NOTE: This version of the graph is not available with the browser you are using. A
more recent version of the browser is required.
Go to the graph's main page
Uploaded on:
May 16, 2023
Description:
The graph is undirected.
The graph's vertices were grouped by cluster using the Clauset-Newman-Moore cluster algorithm.
The graph was laid out using the Random layout algorithm.
Overall Graph Metrics:
Vertices: 17
Unique Edges: 43
Edges With Duplicates: 0
Total Edges: 43
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: 17
Maximum Edges in a Connected Component: 43
Maximum Geodesic Distance (Diameter): 4
Average Geodesic Distance: 1.799308
Graph Density: 0.316176470588235
Modularity: 0.187399
NodeXL Version: 1.0.1.448