Guest

May 19, 2022

The graph was imported from the open workbook "통합 문서1".

The graph is directed.

The graph's vertices were grouped by cluster using the Girvan-Newman cluster algorithm.

The graph was laid out using the Fruchterman-Reingold 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: 24
Unique Edges: 286
Edges With Duplicates: 0
Total Edges: 286
Self-Loops: 24
Reciprocated Vertex Pair Ratio: 0.969924812030075
Reciprocated Edge Ratio: 0.984732824427481
Connected Components: 2
Single-Vertex Connected Components: 0
Maximum Vertices in a Connected Component: 14
Maximum Edges in a Connected Component: 191
Maximum Geodesic Distance (Diameter): 2
Average Geodesic Distance: 0.939189
Graph Density: 0.47463768115942
Modularity: 0.339711
NodeXL Version: 1.0.1.449