Table 1 Variable legend and overall layout algorithm

Type

Name

Detail

Priority Queue

Q

Queue of nodes with largest node betweenness first

Array

N odeBC [v]

Betweenness values for node v

2D Array

EdgeBC [v₁] [v₂]

Edge betweenness from v₁ to v₂

Set

S

Empty set (contains nodes already placed)

Map

H

Empty multi-value map (Key – node, Value – orphans with v as parent)

Tree

T

Tree contains a quadtree containing nodes in Table 4

double

C ₁

controls how far from the parent nodes are initially placed

double

threshold

lower values force tighter convergence constraints

double

C ₂

controls how far nodes are moved each iteration

integer

k _max

controls when to cut off simulated annealing loops

double

K ₁

controls how much density is used in score calculation

double

K ₂

controls how much edge lengths are used

double

K ₃

controls how important edge crossings are

int

maxT reeSize

sets how large each bucket can be in the quadtree