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
|
'use strict';
import { network } from './topology';
test('basic network functionality', () => {
const n = network(0, 5, 0);
expect(n).toEqual({
input_count: 0,
output_count: 0,
adjacency: [ [], [], [], [], [] ],
weight: [],
});
expect(() => n.adjacency = []).toThrow();
expect(() => n.weight = []).toThrow();
const nn = n.connect(0, 1, -2);
expect(nn).toEqual({
input_count: 0,
output_count: 0,
adjacency: [
[ 1 ],
[ -1 ],
[ 0 ],
[ 0 ],
[ 0 ]
],
weight: [ -2 ],
});
expect(() => nn.adjacency = []).toThrow();
expect(() => nn.weight = []).toThrow();
const nnn = nn.connect(2, 4, 3);
expect(nnn).toEqual({
input_count: 0,
output_count: 0,
adjacency: [
[ 1, 0 ],
[ -1, 0 ],
[ 0, 1 ],
[ 0, 0 ],
[ 0, -1 ]
],
weight: [ -2, 3 ],
});
expect(() => nnn.adjacency = []).toThrow();
expect(() => nnn.weight = []).toThrow();
});
test(
'networks are restricted from sinking to inputs or sourcing from outputs',
() => {
const n = network(2, 2, 2);
expect(n.connect(1,2,0)).toEqual({
input_count: 2,
output_count: 2,
adjacency: [
[ 0 ],
[ 1 ],
[ -1 ],
[ 0 ],
[ 0 ],
[ 0 ],
],
weight: [ 0 ],
});
expect(() => n.connect(2, 1, 0)).toThrow();
expect(n.connect(3, 4, 2)).toEqual({
input_count: 2,
output_count: 2,
adjacency: [
[ 0 ],
[ 0 ],
[ 0 ],
[ 1 ],
[ -1 ],
[ 0 ],
],
weight: [ 2 ],
});
expect(() => n.connect(4, 3, 2)).toThrow();
});
test('self-connections work correctly', () => {
const n = network(0, 1, 0).connect(0, 0, 2.0);
expect(n).toEqual({
input_count: 0,
output_count: 0,
adjacency: [
[ 2 ],
],
weight: [ 2 ],
});
});
|
