NodeXL_S_Dinner.xlsx, 10/24/2020 2:41:31 PM, 238653


FAQ | Problem?

NodeXL_S_Dinner.xlsx
NodeXL_S_Dinner.xlsx
From:
Guest
Uploaded on:
October 24, 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: 11
Unique Edges: 44
Edges With Duplicates: 0
Total Edges: 44
Self-Loops: 0
Reciprocated Vertex Pair Ratio: 0
Reciprocated Edge Ratio: 0
Connected Components: 1
Single-Vertex Connected Components: 0
Maximum Vertices in a Connected Component: 11
Maximum Edges in a Connected Component: 44
Maximum Geodesic Distance (Diameter): 2
Average Geodesic Distance: 1.090909
Graph Density: 0.4
Modularity: 0.024793
NodeXL Version: 1.0.1.441
Tags: