FAQ | Problem?

reciprocity ties
reciprocity ties
Uploaded on:
November 14, 2017
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: 3315
Unique Edges: 6957
Edges With Duplicates: 0
Total Edges: 6957
Self-Loops: 0
Reciprocated Vertex Pair Ratio: 0,00651041666666667
Reciprocated Edge Ratio: 0,0129366106080207
Connected Components: 1
Single-Vertex Connected Components: 0
Maximum Vertices in a Connected Component: 3315
Maximum Edges in a Connected Component: 6957
Maximum Geodesic Distance (Diameter): 12
Average Geodesic Distance: 5,450115
Graph Density: 0,000633265701248235
Modularity: 0,524535
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