Marketing Research MediaWiki Map
Uploaded on:
January 22, 2019
Description:
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 widths are based on edge weight values. The vertex sizes are based on betweenness centrality values.
Overall Graph Metrics:
Vertices: 103
Unique Edges: 102
Edges With Duplicates: 0
Total Edges: 102
Self-Loops: 0
Reciprocated Vertex Pair Ratio: 0
Reciprocated Edge Ratio: 0
Connected Components: 1
Single-Vertex Connected Components: 0
Maximum Vertices in a Connected Component: 103
Maximum Edges in a Connected Component: 102
Maximum Geodesic Distance (Diameter): 2
Average Geodesic Distance: 1.961354
Graph Density: 0.00970873786407767
Modularity: 0
NodeXL Version: 1.0.1.408
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