Guest

September 17, 2019

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 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. The vertex sizes are based on betweenness centrality values.

Overall Graph Metrics:
Vertices: 8
Unique Edges: 64
Edges With Duplicates: 0
Total Edges: 64
Self-Loops: 8
Reciprocated Vertex Pair Ratio: 1
Reciprocated Edge Ratio: 1
Connected Components: 1
Single-Vertex Connected Components: 0
Maximum Vertices in a Connected Component: 8
Maximum Edges in a Connected Component: 64
Maximum Geodesic Distance (Diameter): 1
Average Geodesic Distance: 0.875
Graph Density: 1
Modularity: 0.195313
NodeXL Version: 1.0.1.419

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