South Park Network Dataset created by ChatGPT (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:
April 19, 2024
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 Harel-Koren Fast Multiscale layout algorithm.
The edge colors are based on frequency values. The edge widths are based on frequency values. The edge opacities are based on frequency values. The vertex colors are based on betweenness centrality values. The vertex sizes are based on betweenness centrality values.
Overall Graph Metrics:
Vertices: 25
Unique Edges: 27
Edges With Duplicates: 0
Total Edges: 27
Self-Loops: 0
Reciprocated Vertex Pair Ratio: 0
Reciprocated Edge Ratio: 0
Connected Components: 6
Single-Vertex Connected Components: 0
Maximum Vertices in a Connected Component: 15
Maximum Edges in a Connected Component: 22
Maximum Geodesic Distance (Diameter): 6
Average Geodesic Distance: 2.155102
Graph Density: 0.045
Modularity: 0.493827
NodeXL Version: 1.0.1.530