ExtraCredit_AbbyTish.xlsx, 7/11/2019 3:51:00 PM, 202781

FAQ | Problem?

Uploaded on:
July 11, 2019
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 Fruchterman-Reingold layout algorithm.

The edge widths are based on frequency values. The vertex sizes are based on degree values. The vertex opacities are based on betweenness centrality values.

Overall Graph Metrics:
Vertices: 21
Unique Edges: 60
Edges With Duplicates: 0
Total Edges: 60
Self-Loops: 0
Reciprocated Vertex Pair Ratio: Not Applicable
Reciprocated Edge Ratio: Not Applicable
Connected Components: 1
Single-Vertex Connected Components: 0
Maximum Vertices in a Connected Component: 21
Maximum Edges in a Connected Component: 60
Maximum Geodesic Distance (Diameter): 3
Average Geodesic Distance: 1.818594
Graph Density: 0.285714285714286
Modularity: 0.276528
NodeXL Version:

Top Words in Tweet in Entire Graph:
[0] Words in Sentiment List#1: Positive
[0] Words in Sentiment List#2: Negative
[0] Words in Sentiment List#3: (Add your own word list)
[0] Non-categorized Words
[0] Total Words