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
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
|
// Copyright ©2014 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 simple_test
import (
"math"
"testing"
"golang.org/x/exp/rand"
"gonum.org/v1/gonum/graph"
"gonum.org/v1/gonum/graph/internal/set"
"gonum.org/v1/gonum/graph/simple"
"gonum.org/v1/gonum/graph/testgraph"
)
func weightedDirectedBuilder(nodes []graph.Node, edges []testgraph.WeightedLine, self, absent float64) (g graph.Graph, n []graph.Node, e []testgraph.Edge, s, a float64, ok bool) {
seen := set.NewNodes()
dg := simple.NewWeightedDirectedGraph(self, absent)
for _, n := range nodes {
seen.Add(n)
dg.AddNode(n)
}
for _, edge := range edges {
if edge.From().ID() == edge.To().ID() {
continue
}
f := dg.Node(edge.From().ID())
if f == nil {
f = edge.From()
}
t := dg.Node(edge.To().ID())
if t == nil {
t = edge.To()
}
ce := simple.WeightedEdge{F: f, T: t, W: edge.Weight()}
seen.Add(ce.F)
seen.Add(ce.T)
e = append(e, ce)
dg.SetWeightedEdge(ce)
}
if len(e) == 0 && len(edges) != 0 {
return nil, nil, nil, math.NaN(), math.NaN(), false
}
if len(seen) != 0 {
n = make([]graph.Node, 0, len(seen))
}
for _, sn := range seen {
n = append(n, sn)
}
return dg, n, e, self, absent, true
}
func TestWeightedDirected(t *testing.T) {
t.Run("EdgeExistence", func(t *testing.T) {
testgraph.EdgeExistence(t, weightedDirectedBuilder, reversesEdges)
})
t.Run("NodeExistence", func(t *testing.T) {
testgraph.NodeExistence(t, weightedDirectedBuilder)
})
t.Run("ReturnAdjacentNodes", func(t *testing.T) {
testgraph.ReturnAdjacentNodes(t, weightedDirectedBuilder, usesEmpty, reversesEdges)
})
t.Run("ReturnAllEdges", func(t *testing.T) {
testgraph.ReturnAllEdges(t, weightedDirectedBuilder, usesEmpty)
})
t.Run("ReturnAllNodes", func(t *testing.T) {
testgraph.ReturnAllNodes(t, weightedDirectedBuilder, usesEmpty)
})
t.Run("ReturnAllWeightedEdges", func(t *testing.T) {
testgraph.ReturnAllWeightedEdges(t, weightedDirectedBuilder, usesEmpty)
})
t.Run("ReturnEdgeSlice", func(t *testing.T) {
testgraph.ReturnEdgeSlice(t, weightedDirectedBuilder, usesEmpty)
})
t.Run("ReturnWeightedEdgeSlice", func(t *testing.T) {
testgraph.ReturnWeightedEdgeSlice(t, weightedDirectedBuilder, usesEmpty)
})
t.Run("ReturnNodeSlice", func(t *testing.T) {
testgraph.ReturnNodeSlice(t, weightedDirectedBuilder, usesEmpty)
})
t.Run("Weight", func(t *testing.T) {
testgraph.Weight(t, weightedDirectedBuilder)
})
t.Run("AddNodes", func(t *testing.T) {
testgraph.AddNodes(t, simple.NewWeightedDirectedGraph(1, 0), 100)
})
t.Run("AddArbitraryNodes", func(t *testing.T) {
testgraph.AddArbitraryNodes(t,
simple.NewWeightedDirectedGraph(1, 0),
testgraph.NewRandomNodes(100, 1, func(id int64) graph.Node { return simple.Node(id) }),
)
})
t.Run("RemoveNodes", func(t *testing.T) {
g := simple.NewWeightedDirectedGraph(1, 0)
it := testgraph.NewRandomNodes(100, 1, func(id int64) graph.Node { return simple.Node(id) })
for it.Next() {
g.AddNode(it.Node())
}
it.Reset()
rnd := rand.New(rand.NewSource(1))
for it.Next() {
u := it.Node()
d := rnd.Intn(5)
vit := g.Nodes()
for d >= 0 && vit.Next() {
v := vit.Node()
if v.ID() == u.ID() {
continue
}
d--
g.SetWeightedEdge(g.NewWeightedEdge(u, v, 1))
}
}
testgraph.RemoveNodes(t, g)
})
t.Run("AddWeightedEdges", func(t *testing.T) {
testgraph.AddWeightedEdges(t, 100,
simple.NewWeightedDirectedGraph(1, 0),
0.5,
func(id int64) graph.Node { return simple.Node(id) },
false, // Cannot set self-loops.
true, // Can update nodes.
)
})
t.Run("NoLoopAddWeightedEdges", func(t *testing.T) {
testgraph.NoLoopAddWeightedEdges(t, 100,
simple.NewWeightedDirectedGraph(1, 0),
0.5,
func(id int64) graph.Node { return simple.Node(id) },
)
})
t.Run("RemoveEdges", func(t *testing.T) {
g := simple.NewWeightedDirectedGraph(1, 0)
it := testgraph.NewRandomNodes(100, 1, func(id int64) graph.Node { return simple.Node(id) })
for it.Next() {
g.AddNode(it.Node())
}
it.Reset()
rnd := rand.New(rand.NewSource(1))
for it.Next() {
u := it.Node()
d := rnd.Intn(5)
vit := g.Nodes()
for d >= 0 && vit.Next() {
v := vit.Node()
if v.ID() == u.ID() {
continue
}
d--
g.SetWeightedEdge(g.NewWeightedEdge(u, v, 1))
}
}
testgraph.RemoveEdges(t, g, g.Edges())
})
}
// Tests Issue #27
func TestWeightedEdgeOvercounting(t *testing.T) {
g := generateDummyWeightedGraph()
if neigh := graph.NodesOf(g.From(int64(2))); len(neigh) != 2 {
t.Errorf("Node 2 has incorrect number of neighbors got neighbors %v (count %d), expected 2 neighbors {0,1}", neigh, len(neigh))
}
}
func generateDummyWeightedGraph() *simple.WeightedDirectedGraph {
nodes := [4]struct{ srcID, targetID int }{
{2, 1},
{1, 0},
{2, 0},
{0, 2},
}
g := simple.NewWeightedDirectedGraph(0, math.Inf(1))
for _, n := range nodes {
g.SetWeightedEdge(simple.WeightedEdge{F: simple.Node(n.srcID), T: simple.Node(n.targetID), W: 1})
}
return g
}
// Test for issue #123 https://github.com/gonum/graph/issues/123
func TestIssue123WeightedDirectedGraph(t *testing.T) {
defer func() {
if r := recover(); r != nil {
t.Errorf("unexpected panic: %v", r)
}
}()
g := simple.NewWeightedDirectedGraph(0, math.Inf(1))
n0 := g.NewNode()
g.AddNode(n0)
n1 := g.NewNode()
g.AddNode(n1)
g.RemoveNode(n0.ID())
n2 := g.NewNode()
g.AddNode(n2)
}
|
