File: join_test.go

package info (click to toggle)
golang-github-yourbasic-graph 1.0.5-3
  • links: PTS, VCS
  • area: main
  • in suites: bookworm, forky, sid, trixie
  • size: 400 kB
  • sloc: makefile: 2
file content (115 lines) | stat: -rw-r--r-- 3,089 bytes parent folder | download | duplicates (2)
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
package build

import "testing"

func TestJoin(t *testing.T) {
	cost := func(v, w int) int64 { return int64(10*v + w) }
	b := EdgeSet{
		From: Range(0, 4),
		To:   Range(0, 4),
		Keep: func(v, w int) bool { return true },
		Cost: Cost(8),
	}
	g := Grid(2, 2)
	res := g.Join(Empty(0), b)
	exp := "4 [{0 1} {0 2} {1 3} {2 3}]"
	if mess, diff := diff(res.String(), exp); diff {
		t.Errorf("Join %s", mess)
	}
	Consistent("Join", t, res)

	res = Empty(0).Join(g, b)
	exp = "4 [{0 1} {0 2} {1 3} {2 3}]"
	if mess, diff := diff(res.String(), exp); diff {
		t.Errorf("Join %s", mess)
	}
	Consistent("Join", t, res)

	b = EdgeSet{
		From: Vertex(1),
		To:   Vertex(3),
		Keep: func(v, w int) bool { return v < w },
		Cost: Cost(8),
	}
	g = Grid(1, 2).AddCostFunc(cost)
	res = g.Join(g, b)
	exp = "4 [(0 1):1 (1 0):10 (1 3):8 (2 3):1 (3 2):10]"
	if mess, diff := diff(res.String(), exp); diff {
		t.Errorf("Join %s", mess)
	}
	Consistent("Join", t, res)

	res = Empty(0).Join(Empty(0), AllEdges())
	exp = Empty(0).String()
	if mess, diff := diff(res.String(), exp); diff {
		t.Errorf("Join %s", mess)
	}
	Consistent("Join", t, res)

	res = Empty(2).Join(Empty(3), AllEdges())
	exp = Kmn(2, 3).String()
	if mess, diff := diff(res.String(), exp); diff {
		t.Errorf("Join %s", mess)
	}
	Consistent("Join", t, res)

	directed := EdgeSet{
		Keep: func(v, w int) bool { return v < w },
	}
	res = Empty(2).Join(Empty(3), directed)
	exp = Kmn(2, 3).Keep(func(v, w int) bool { return v < w }).String()
	if mess, diff := diff(res.String(), exp); diff {
		t.Errorf("Join %s", mess)
	}
	Consistent("Join", t, res)

	directed.Cost = Cost(3)
	res = Kn(2).AddCost(1).Join(Kn(2).AddCost(2), directed)
	exp = "4 [{0 1}:1 (0 2):3 (0 3):3 (1 2):3 (1 3):3 {2 3}:2]"
	if mess, diff := diff(res.String(), exp); diff {
		t.Errorf("Join %s", mess)
	}
	Consistent("Join", t, res)

	full := AllEdges()
	full.Cost = Cost(3)
	res = Kn(1).AddCost(1).Join(Kn(1).AddCost(2), full)
	exp = "2 [{0 1}:3]"
	if mess, diff := diff(res.String(), exp); diff {
		t.Errorf("Join %s", mess)
	}
	Consistent("Join", t, res)

	directed.Cost = Cost(9)
	g = Kn(1).AddCost(8).Join(Grid(1, 2).AddCostFunc(cost), directed)
	exp = "3 [(0 1):9 (0 2):9 (1 2):1 (2 1):10]"
	if mess, diff := diff(g.String(), exp); diff {
		t.Errorf("Join %s", mess)
	}
	Consistent("Join", t, g)

	res = Empty(2).Join(Empty(3), EdgeSet{Range(0, 1), Range(3, 4), nil, nil})
	exp = "5 [{0 3}]"
	if mess, diff := diff(res.String(), exp); diff {
		t.Errorf("Join %s", mess)
	}
	Consistent("Join", t, res)

	b = EdgeSet{Range(0, 1), Range(2, 3), nil, nil}
	res = Kn(2).AddCost(1).Join(Kn(2).AddCost(2), b)
	exp = "4 [{0 1}:1 {0 2} {2 3}:2]"
	if mess, diff := diff(res.String(), exp); diff {
		t.Errorf("Join %s", mess)
	}
	Consistent("Join", t, res)

	for m := 0; m < 4; m++ {
		for n := 0; n < 4; n++ {
			b := EdgeSet{Range(m, n), Range(m-n, m+n), nil, nil}
			res = Kn(m).AddCostFunc(cost).Join(Grid(m, m+n).AddCostFunc(cost), b)
			Consistent("Join", t, res)
			res = Grid(m, m+n).AddCostFunc(cost).Join(Kn(m).AddCostFunc(cost), b)
			Consistent("Join", t, res)
		}
	}
}