FilesExpand file tree

 master

/

22_fast.js

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

156 lines (143 loc) · 4.59 KB

 master

/

22_fast.js

Copy path

Top

File metadata and controls

• Code
• Blame

156 lines (143 loc) · 4.59 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

145

146

147

148

149

150

151

152

153

154

155

156

var GraphNode = class GraphNode {

constructor() {

this.pos = new Vec(Math.random() * 1000,

Math.random() * 1000);

this.edges = [];

}

connect(other) {

this.edges.push(other);

other.edges.push(this);

}

hasEdge(other) {

return this.edges.includes(other);

}

}

function treeGraph(depth, branches) {

let graph = [new GraphNode()];

if (depth > 1) {

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

let subGraph = treeGraph(depth - 1, branches);

graph[0].connect(subGraph[0]);

graph = graph.concat(subGraph);

}

}

return graph;

}

var springLength = 40;

var springStrength = 0.1;

var repulsionStrength = 1500;

function forceDirected_simple(graph) {

for (let node of graph) {

for (let other of graph) {

if (other == node) continue;

let apart = other.pos.minus(node.pos);

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

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

if (node.hasEdge(other)) {

forceSize += (distance - springLength) * springStrength;

}

let normalized = apart.times(1 / distance);

node.pos = node.pos.plus(normalized.times(forceSize));

}

}

}

function runLayout(implementation, graph) {

function run(steps, time) {

let startTime = Date.now();

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

implementation(graph);

}

time += Date.now() - startTime;

drawGraph(graph);

if (steps == 0) console.log(time);

else requestAnimationFrame(() => run(steps - 100, time));

}

run(4000, 0);

}

function forceDirected_noRepeat(graph) {

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

let node = graph[i];

for (let j = i + 1; j < graph.length; j++) {

let other = graph[j];

let apart = other.pos.minus(node.pos);

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

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

if (node.hasEdge(other)) {

forceSize += (distance - springLength) * springStrength;

}

let applied = apart.times(forceSize / distance);

node.pos = node.pos.plus(applied);

other.pos = other.pos.minus(applied);

}

}

}

var skipDistance = 175;

function forceDirected_skip(graph) {

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

let node = graph[i];

for (let j = i + 1; j < graph.length; j++) {

let other = graph[j];

let apart = other.pos.minus(node.pos);

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

let hasEdge = node.hasEdge(other);

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

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

if (hasEdge) {

forceSize += (distance - springLength) * springStrength;

}

let applied = apart.times(forceSize / distance);

node.pos = node.pos.plus(applied);

other.pos = other.pos.minus(applied);

}

}

}

GraphNode.prototype.hasEdgeFast = function(other) {

for (let i = 0; i < this.edges.length; i++) {

if (this.edges[i] === other) return true;

}

return false;

};

function forceDirected_hasEdgeFast(graph) {

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

let node = graph[i];

for (let j = i + 1; j < graph.length; j++) {

let other = graph[j];

let apart = other.pos.minus(node.pos);

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

let hasEdge = node.hasEdgeFast(other);

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

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

if (hasEdge) {

forceSize += (distance - springLength) * springStrength;

}

let applied = apart.times(forceSize / distance);

node.pos = node.pos.plus(applied);

other.pos = other.pos.minus(applied);

}

}

}

function forceDirected_noVector(graph) {

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

let node = graph[i];

for (let j = i + 1; j < graph.length; j++) {

let other = graph[j];

let apartX = other.pos.x - node.pos.x;

let apartY = other.pos.y - node.pos.y;

let distance = Math.max(1, Math.sqrt(apartX * apartX + apartY * apartY));

let hasEdge = node.hasEdgeFast(other);

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

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

if (hasEdge) {

forceSize += (distance - springLength) * springStrength;

}

let forceX = apartX * forceSize / distance;

let forceY = apartY * forceSize / distance;

node.pos.x += forceX; node.pos.y += forceY;

other.pos.x -= forceX; other.pos.y -= forceY;

}

}

}

var mangledGraph = treeGraph(4, 4);

for (let node of mangledGraph) {

node[`p${Math.floor(Math.random() * 999)}`] = true;

}