Claire_COM301_Les_Miserable.xlsx
Uploaded on:
February 16, 2019
Description:
The graph is directed.
The graph was laid out using the Harel-Koren Fast Multiscale layout algorithm.
The vertex sizes are based on eigenvector centrality values. The vertex opacities are based on eigenvector centrality values.
Overall Graph Metrics:
Vertices: 77
Unique Edges: 254
Edges With Duplicates: 0
Total Edges: 254
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: 77
Maximum Edges in a Connected Component: 254
Maximum Geodesic Distance (Diameter): 5
Average Geodesic Distance: 2.606848
Graph Density: 0.043403964456596
Modularity: Not Applicable
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