Guest

October 12, 2021

The graph was imported from the open matrix workbook "campdata.xls".

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 Fruchterman-Reingold layout algorithm.

Overall Graph Metrics:
Vertices: 21
Unique Edges: 416
Edges With Duplicates: 0
Total Edges: 416
Self-Loops: 0
Reciprocated Vertex Pair Ratio: 0.980952380952381
Reciprocated Edge Ratio: 0.990384615384615
Connected Components: 1
Single-Vertex Connected Components: 0
Maximum Vertices in a Connected Component: 21
Maximum Edges in a Connected Component: 416
Maximum Geodesic Distance (Diameter): 1
Average Geodesic Distance: 0.952381
Graph Density: 0.990476190476191
Modularity: 0.249977
NodeXL Version: 1.0.1.447