Guest

November 21, 2019

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.

Overall Graph Metrics:
Vertices: 17
Unique Edges: 136
Edges With Duplicates: 0
Total Edges: 136
Self-Loops: 9
Reciprocated Vertex Pair Ratio: 0.351063829787234
Reciprocated Edge Ratio: 0.519685039370079
Connected Components: 1
Single-Vertex Connected Components: 0
Maximum Vertices in a Connected Component: 17
Maximum Edges in a Connected Component: 136
Maximum Geodesic Distance (Diameter): 2
Average Geodesic Distance: 1.231834
Graph Density: 0.466911764705882
Modularity: 0.141585
NodeXL Version: 1.0.1.421

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