clairehoffman

July 10, 2019

The graph is directed.

The graph's vertices were grouped by cluster using the Wakita-Tsurumi 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 eigenvector centrality values. The vertex opacities are based on degree values.

Overall Graph Metrics:
Vertices: 10
Unique Edges: 10
Edges With Duplicates: 15
Total Edges: 25
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: 10
Maximum Edges in a Connected Component: 25
Maximum Geodesic Distance (Diameter): 3
Average Geodesic Distance: 1.58
Graph Density: 0.333333333333333
Modularity: Not Applicable
NodeXL Version: 1.0.1.413

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