An adjacency matrix showing character co-occurrence in Les Misérables. This
visualization shows character relationships in Victor Hugo's novel,
Les Misérables. The data is a network, where
nodes represent characters in the novel, and edges represent two characters appearing in the same chapter.
While this data can be drawn as a node-link graph, this chart is an adjacency matrix. Since co-occurrences are
not directed, the chart is symmetrical. The characters are ordered according to a clustering algorithm which
detects character communities, rather than alphabetically, or by total co-occurrences.
D. E. Knuth, The Stanford GraphBase: A
Platform for Combinatorial Computing, Addison-Wesley, Reading, MA (1993). Data linked from
vega-datasets.