FilesExpand file tree

 master

/

22_fast.js

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

144 lines (129 loc) · 3.82 KB

 master

/

22_fast.js

Copy path

Top

File metadata and controls

• Code
• Blame

144 lines (129 loc) · 3.82 KB

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

33

34

35

36

37

38

39

40

41

42

43

44

45

46

47

48

49

50

51

52

53

54

55

56

57

58

59

60

61

62

63

64

65

66

67

68

69

70

71

72

73

74

75

76

77

78

79

80

81

82

83

84

85

86

87

88

89

90

91

92

93

94

95

96

97

98

99

100

101

102

103

104

105

106

107

108

109

110

111

112

113

114

115

116

117

118

119

120

121

122

123

124

125

126

127

128

129

130

131

132

133

134

135

136

137

138

139

140

141

142

143

144

var Graph = class Graph {

#nodes = [];

get size() {

return this.#nodes.length;

}

addNode() {

let id = this.#nodes.length;

this.#nodes.push(new Set());

return id;

}

addEdge(nodeA, nodeB) {

this.#nodes[nodeA].add(nodeB);

this.#nodes[nodeB].add(nodeA);

}

neighbors(node) {

return this.#nodes[node];

}

}

function randomLayout(graph) {

let layout = [];

for (let i = 0; i < graph.size; i++) {

layout.push(new Vec(Math.random() * 1000,

Math.random() * 1000));

}

return layout;

}

function gridGraph(size) {

let grid = new Graph();

for (let y = 0; y < size; y++) {

for (let x = 0; x < size; x++) {

let id = grid.addNode();

if (x > 0) grid.addEdge(id, id - 1);

if (y > 0) grid.addEdge(id, id - size);

}

}

return grid;

}

var springLength = 20;

var springStrength = 0.1;

var repulsionStrength = 1500;

function forceSize(distance, connected) {

let repulse = -repulsionStrength / (distance * distance);

let spring = 0;

if (connected) {

spring = (distance - springLength) * springStrength;

}

return spring + repulse;

}

function forceDirected_simple(layout, graph) {

for (let a = 0; a < graph.size; a++) {

for (let b = 0; b < graph.size; b++) {

if (a == b) continue;

let apart = layout[b].minus(layout[a]);

let distance = Math.max(1, apart.length);

let connected = graph.neighbors(a).has(b);

let size = forceSize(distance, connected);

let force = apart.times(1 / distance).times(size);

layout[a] = layout[a].plus(force);

}

}

}

function pause() {

return new Promise(done => setTimeout(done, 0))

}

async function runLayout(implementation, graph) {

let time = 0, iterations = 0;

let layout = randomLayout(graph);

while (time < 3000) {

let start = Date.now();

for (let i = 0; i < 100; i++) {

implementation(layout, graph);

iterations++;

}

time += Date.now() - start;

drawGraph(graph, layout);

await pause();

}

let perSecond = Math.round(iterations / (time / 1000));

console.log(`${perSecond} iterations per second`);

}

function forceDirected_noRepeat(layout, graph) {

for (let a = 0; a < graph.size; a++) {

for (let b = a + 1; b < graph.size; b++) {

let apart = layout[b].minus(layout[a]);

let distance = Math.max(1, apart.length);

let connected = graph.neighbors(a).has(b);

let size = forceSize(distance, connected);

let force = apart.times(1 / distance).times(size);

layout[a] = layout[a].plus(force);

layout[b] = layout[b].minus(force);

}

}

}

var skipDistance = 175;

function forceDirected_skip(layout, graph) {

for (let a = 0; a < graph.size; a++) {

for (let b = a + 1; b < graph.size; b++) {

let apart = layout[b].minus(layout[a]);

let distance = Math.max(1, apart.length);

let connected = graph.neighbors(a).has(b);

if (distance > skipDistance && !connected) continue;

let size = forceSize(distance, connected);

let force = apart.times(1 / distance).times(size);

layout[a] = layout[a].plus(force);

layout[b] = layout[b].minus(force);

}

}

}

function forceDirected_noVector(layout, graph) {

for (let a = 0; a < graph.size; a++) {

let posA = layout[a];

for (let b = a + 1; b < graph.size; b++) {

let posB = layout[b];

let apartX = posB.x - posA.x

let apartY = posB.y - posA.y;

let distance = Math.sqrt(apartX * apartX +

apartY * apartY);

let connected = graph.neighbors(a).has(b);

if (distance > skipDistance && !connected) continue;

let size = forceSize(distance, connected);

let forceX = (apartX / distance) * size;

let forceY = (apartY / distance) * size;

posA.x += forceX;

posA.y += forceY;

posB.x -= forceX;

posB.y -= forceY;

}

}

}