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
|
// Copyright ©2015 The Gonum Authors. All rights reserved.
// Use of this source code is governed by a BSD-style
// license that can be found in the LICENSE file.
package gen
import (
"testing"
"gonum.org/v1/gonum/graph/simple"
)
func TestTunableClusteringScaleFree(t *testing.T) {
t.Parallel()
for n := 2; n <= 20; n++ {
for m := 0; m < n; m++ {
for p := 0.; p <= 1; p += 0.1 {
g := &gnUndirected{UndirectedBuilder: simple.NewUndirectedGraph()}
orig := g.NewNode()
g.AddNode(orig)
err := TunableClusteringScaleFree(g, n, m, p, nil)
if err != nil {
t.Fatalf("unexpected error: n=%d, m=%d, p=%v: %v", n, m, p, err)
}
if g.From(orig.ID()).Len() != 0 {
t.Errorf("edge added from already existing node: n=%d, m=%d, p=%v", n, m, p)
}
if g.addBackwards {
t.Errorf("edge added with From.ID > To.ID: n=%d, m=%d, p=%v", n, m, p)
}
if g.addSelfLoop {
t.Errorf("unexpected self edge: n=%d, m=%d, p=%v", n, m, p)
}
if g.addMultipleEdge {
t.Errorf("unexpected multiple edge: n=%d, m=%d, p=%v", n, m, p)
}
}
}
}
}
func TestPreferentialAttachment(t *testing.T) {
t.Parallel()
for n := 2; n <= 20; n++ {
for m := 0; m < n; m++ {
g := &gnUndirected{UndirectedBuilder: simple.NewUndirectedGraph()}
err := PreferentialAttachment(g, n, m, nil)
if err != nil {
t.Fatalf("unexpected error: n=%d, m=%d: %v", n, m, err)
}
if g.addBackwards {
t.Errorf("edge added with From.ID > To.ID: n=%d, m=%d", n, m)
}
if g.addSelfLoop {
t.Errorf("unexpected self edge: n=%d, m=%d", n, m)
}
if g.addMultipleEdge {
t.Errorf("unexpected multiple edge: n=%d, m=%d", n, m)
}
}
}
}
|
