We visualize the network of characters with an undirected graph <hi xmlns="http://www.tei-c.org/ns/1.0" rend="italic">G=(V,E)</hi>, where <hi xmlns="http://www.tei-c.org/ns/1.0" rend="italic">V</hi> are the vertices, each vertex corresponding to one character, and each edge <hi xmlns="http://www.tei-c.org/ns/1.0" rend="italic">E=(V</hi> <hi xmlns="http://www.tei-c.org/ns/1.0" rend="italic">i,</hi> <hi xmlns="http://www.tei-c.org/ns/1.0" rend="italic">,V</hi> <hi xmlns="http://www.tei-c.org/ns/1.0" rend="italic">j</hi> <hi xmlns="http://www.tei-c.org/ns/1.0" rend="italic">)</hi> corresponding to relations between pairs of characters. We output the following measures for each character node: <hi xmlns="http://www.tei-c.org/ns/1.0" rend="italic">degree</hi>, <hi xmlns="http://www.tei-c.org/ns/1.0" rend="italic">edge weight</hi>, <hi xmlns="http://www.tei-c.org/ns/1.0" rend="italic">weighted degree </hi>and <hi xmlns="http://www.tei-c.org/ns/1.0" rend="italic">density</hi>. The degree is the number of edges occurring with a given vertex. The edge weight, <hi xmlns="http://www.tei-c.org/ns/1.0" rend="italic">w</hi> <hi xmlns="http://www.tei-c.org/ns/1.0" rend="italic">i,j</hi><hi xmlns="http://www.tei-c.org/ns/1.0" rend="math"> ≥ </hi>0, is defined as the number of interactions between the vertices V <hi xmlns="http://www.tei-c.org/ns/1.0" rend="italic">i</hi> and V <hi xmlns="http://www.tei-c.org/ns/1.0" rend="italic">j</hi>. The weighted degree is the sum of weights of the edges occurring with a vertex <hi xmlns="http://www.tei-c.org/ns/1.0" rend="italic">i</hi>. Density is the ratio of occurring edges between two vertices and all possible vertex pairs.