package/gonum
1
0
Fork 0
mirror of https://github.com/gonum/gonum.git synced 2025-10-18 21:15:23 +08:00
Code Issues Actions Packages Projects Releases Wiki Activity

graph/simple: separate weighted and unweighted edge implementations

Browse Source
This commit is contained in:
kortschak
2017-08-22 15:53:09 +09:30
parent 7ba61f0ead
commit f739fbf133
27 changed files with 192 additions and 181 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
graph/community/bisect_test.go
View File

@@ -66,7 +66,7 @@ func init() {
friends.AddNode(simple.Node(u))
}
for v := range e {
friends.SetWeightedEdge(simple.Edge{F: simple.Node(u), T: simple.Node(v), W: 1})
friends.SetWeightedEdge(simple.WeightedEdge{F: simple.Node(u), T: simple.Node(v), W: 1})
}
}
enemies = simple.NewWeightedUndirectedGraph(0, 0)
@@ -76,7 +76,7 @@ func init() {
enemies.AddNode(simple.Node(u))
}
for v := range e {
enemies.SetWeightedEdge(simple.Edge{F: simple.Node(u), T: simple.Node(v), W: -1})
enemies.SetWeightedEdge(simple.WeightedEdge{F: simple.Node(u), T: simple.Node(v), W: -1})
}
}
}
@@ -148,7 +148,7 @@ func TestProfileWeightedUndirected(t *testing.T) {
g.AddNode(simple.Node(u))
}
for v := range e {
g.SetWeightedEdge(simple.Edge{F: simple.Node(u), T: simple.Node(v), W: 1})
g.SetWeightedEdge(simple.WeightedEdge{F: simple.Node(u), T: simple.Node(v), W: 1})
}
}
@@ -207,7 +207,7 @@ func TestProfileWeightedDirected(t *testing.T) {
g.AddNode(simple.Node(u))
}
for v := range e {
g.SetWeightedEdge(simple.Edge{F: simple.Node(u), T: simple.Node(v), W: 1})
g.SetWeightedEdge(simple.WeightedEdge{F: simple.Node(u), T: simple.Node(v), W: 1})
}
}