과제2_박경태.xlsx, 10/16/2020 6:27:40 AM, 238061


FAQ | Problem?

과제2_박경태.xlsx
과제2_박경태.xlsx
From:
Guest
Uploaded on:
October 16, 2020
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 edge weight values. The edge opacities are based on edge weight values. The vertex sizes are based on betweenness centrality values.

Overall Graph Metrics:
Vertices: 584
Unique Edges: 6585
Edges With Duplicates: 0
Total Edges: 6585
Self-Loops: 0
Reciprocated Vertex Pair Ratio: Not Applicable
Reciprocated Edge Ratio: Not Applicable
Connected Components: 7
Single-Vertex Connected Components: 5
Maximum Vertices in a Connected Component: 576
Maximum Edges in a Connected Component: 6582
Maximum Geodesic Distance (Diameter): 5
Average Geodesic Distance: 2.566722
Graph Density: 0.0386815949622876
Modularity: 0.450435
NodeXL Version: 1.0.1.441
Tags: