Seoul_District+.xlsx, 10/30/2020 4:58:59 PM, 239177


FAQ | Problem?

Seoul_District+.xlsx
Seoul_District .xlsx
From:
Guest
Uploaded on:
October 30, 2020
Description:
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: 25
Unique Edges: 589
Edges With Duplicates: 0
Total Edges: 589
Self-Loops: 0
Reciprocated Vertex Pair Ratio: 0.963333333333333
Reciprocated Edge Ratio: 0.981324278438031
Connected Components: 1
Single-Vertex Connected Components: 0
Maximum Vertices in a Connected Component: 25
Maximum Edges in a Connected Component: 589
Maximum Geodesic Distance (Diameter): 1
Average Geodesic Distance: 0.96
Graph Density: 0.981666666666667
Modularity: 0.249913
NodeXL Version: 1.0.1.441
Tags:
 

We use necessary cookies to make our site work. We’d like to set additional cookies to understand site usage, make site improvements and to remember your settings. We also use cookies set by other sites to help deliver content from their services.