\(~\)
This undirected network contains co-occurrences of characters in Victor Hugo’s novel, Les Misérables.
A node represents a character, and an edge between two nodes shows that these two characters appeared in the same chapter of the book.
Select by ID = to browse by different characters.
Select by Group = to browse by color-coded communities of characters.
\(~\)
Scroll down and drag the nodes to move them around.
nodes <- jsonlite::fromJSON("https://raw.githubusercontent.com/datastorm-open/datastorm-open.github.io/master/visNetwork/data/nodes_miserables.json")
edges <- jsonlite::fromJSON("https://raw.githubusercontent.com/datastorm-open/datastorm-open.github.io/master/visNetwork/data/edges_miserables.json")
set.seed(1)
visNetwork(nodes, edges, height = "520px", width = "100%", style = "font-family:Comic Sans MS; font-size:30px") %>%
visNodes(font = list(size = 20), physics = FALSE) %>%
visOptions(selectedBy = "group",
highlightNearest = TRUE,
nodesIdSelection = TRUE) %>%
visPhysics(stabilization = TRUE, timestep = 0, forceAtlas2Based = list(gravitationalConstant = -0.1, avoidOverlap = 0.9))References
Knuth, D. E. (1993) „Les miserables: coappearance network of characters in the novel les miserables“, The Stanford GraphBase: A Platform for Combinatorial Computing, Addison-Wesley, Reading, MA