This is chart where each node is a character in Les Misérables, and each link indicates that they appear in a scene together. This is called character co-occurrence. This data was downloaded by Stephen Suen in 2016 from The Stanford GraphBase.
Here is a graph of how your data is connected. Any nodes linked by an edge show up in the same row in your input data. Your network graph has 77 nodes and 254 edges.
What do I do next?
Understanding relationships as nodes and edges in a network can lead to deeper insights about how information travels through the system. For example, what role does Valjean, the Connector, play in the network?
You can start to look for patterns in the nodes that are the most and least connected. For example, is it significant that Gavroche has the 2nd highest number of connections but is ranked 3rd for betweenness centrality? Why does MotherPlutarch have the fewest connections?
Being curious about these measures and patterns is the first step in understanding network data. Check out our activity guide for more help on analyzing network data.
Try these other tools to do more full-fledged analysis: