1. A method of graphing data, comprising: generating, by a processor, a first layout from a spring-electrical algorithm, the first layout comprising multiple vertices and a location for each vertex in the multiple vertices; generating a second layout that removes overlapping nodes produced by the spring-electrical algorithm by: generating a current location for each vertex in the first layout; confining each vertex in the first layout to a proximity location about the current location; determining a vertex and another vertex overlap; moving the vertex within the proximity location to remove the overlap; generating a first proximity graph for the first layout using triangulation; generating a second proximity graph for the second layout using the triangulation; measuring distances between vertices along edges of the first proximity graph; measuring the distances between the vertices along the edges of the second proximity graph; calculating edge length ratios of lengths of the edges between the first proximity graph and the second proximity graph; calculating a mean of the edge length ratios; and measuring a dissimilarity of the edge length ratios using a normalized standard deviation σ dist ⁡ ( x 0 , x ) = ∑ { i , j } ∈ E p ⁢ ( r ij - r _ ) 2  E p  r _ , ⁢ where r _ = 1  E P  ⁢ ∑ { i , j } ∈ E P ⁢ r ij is the mean of the edge length ratios, x 0 and x denote the first layout and the second layout, and E P is a set of edges in the triangulation.