BFL: a node and edge betweenness based fast layout algorithm for large scale networks

BMC Bioinformatics

Table 3 Score functions.

1: procedure ENERGY OF(v,currentCoord)
2: Add energy ← c₃ density(v,currentCoord)
3: Add energy ← c₄ edgeLength(v,currentCoord)
4: Add energy ← c₅ edgeCrosses(v,currentCoord)
5: Return energy
6: end procedure
7: procedure DENSITY(v,currentCoord)
8: for all node in Set s do
9: Add density ← $\frac{L o g (N o d e B C [n o d e] + 1)}{D i s t a n c e {(v, n o d e)}^{2}}$
10: if v and node overlap then 11: Return ∞
12: end if
13: end for
14: Return density
15: end procedure
16: procedure EDGE LENGTH(v,currentCoord)
17: for all Edges of v connected to a destination in S do
18: Add length ← EdgeBC [v] [destination] * Distance(v, destination)²
19: end for
20: Return length
21: end procedure
22: procedure EDGE CROSSES(v,currentCoord)
23: for all Edges in v connected to a destination in S do
24: Add crosses ← CountIntersections(Edges) * EdgeBC [v] [destination] ▹ Intersections should be counted with an efficent Ray-Shooting algorithm
25: end for
26: Return crosses
27: end procedure

Shows scoring functions for each aesthetic parameter, weighted by betweenness scores.

ISSN: 1471-2105