> Whenever two characters appeared within 15 words of one another, a link (or “edge”) was added between them. The links are weighted based on how often the two

> Whenever two characters appeared within 15 words of one another, a link (or “edge”) was added between them. The links are weighted based on how often the two characters appeared in close proximity. The interesting part here is that the algorithm needs no upfront understanding about the relationships nor about the type of interactions between characters. You can construct the graph from just looking at the locations of the words associated with each character.