-
Notifications
You must be signed in to change notification settings - Fork 0
/
routing.go
194 lines (167 loc) · 3.4 KB
/
routing.go
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
package gomap
import (
"errors"
"math"
"github.com/takoyaki-3/go-map/v2/prioque"
)
type Query struct {
From int
To int
}
type Output struct {
Nodes []int
Cost float64
}
type cfb struct {
cost float64
flag bool
before int
}
//
func (g *Graph) Routing(query Query) (Output, error) {
q := prioque.NewMinSet()
cfbs := make([]cfb, len(g.Nodes))
for k, _ := range cfbs {
cfbs[k].cost = math.MaxFloat64
cfbs[k].before = -1
}
if len(g.Nodes) <= int(query.From) || len(g.Nodes) <= int(query.To) {
return Output{}, errors.New("query node index not found.")
}
cfbs[query.From].cost = 0.0
cfbs[query.From].before = -2
q.AddVal(query.From, 0.0)
var pos int
for q.Len() > 0 {
pos = q.GetMin()
if cfbs[pos].flag {
continue
}
cfbs[pos].flag = true
if pos == query.To {
break
}
for _, eid := range g.FromEdges[pos] {
e := g.Edges[eid]
eto := e.ToNode
if cfbs[eto].flag {
continue
}
etoCost := cfbs[pos].cost + e.Weight
if cfbs[eto].cost <= etoCost {
continue
}
cfbs[eto].cost = etoCost
cfbs[eto].before = pos
if len(e.ViaNodes) == 0 {
cfbs[eto].before = pos
} else {
if eto != e.ViaNodes[len(e.ViaNodes)-1] {
cfbs[eto].before = e.ViaNodes[len(e.ViaNodes)-1]
}
if e.ViaNodes[0] != pos {
cfbs[e.ViaNodes[0]].before = pos
}
for k, v := range e.ViaNodes {
if k == 0 {
continue
}
if v != e.ViaNodes[k-1] {
cfbs[v].before = e.ViaNodes[k-1]
}
}
}
q.AddVal(eto, etoCost)
}
}
// 出力
pos = query.To
out := Output{}
if pos == query.To {
out.Cost = cfbs[pos].cost
out.Nodes = append([]int{pos}, out.Nodes...)
bef := cfbs[pos].before
if bef == -1 {
return Output{}, errors.New("path not found")
}
for bef != -2 {
out.Nodes = append([]int{bef}, out.Nodes...)
bef = cfbs[bef].before
}
}
return out, nil
}
func (g *Graph) Voronoi(bases []int) map[int]int {
// initialization
q := prioque.NewMinSet()
cfbs := make([]cfb, len(g.Nodes))
start_group := map[int]int{}
counter := 0
for k, _ := range cfbs {
cfbs[k].before = -1
cfbs[k].cost = math.MaxFloat64
}
for _, v := range bases {
cfbs[v].cost = 0.0
q.AddVal(v, 0.0)
start_group[int(v)] = counter % 20
counter++
}
for q.Len() > 0 {
pos := q.GetMin()
if cfbs[pos].flag {
continue
}
cfbs[pos].flag = true
// グラフ拡張処理
for _, eid := range g.FromEdges[pos] {
e := g.Edges[eid]
eto := e.ToNode
if cfbs[eto].flag {
continue
}
if cfbs[eto].cost <= cfbs[pos].cost+e.Weight {
continue
}
cfbs[eto].cost = cfbs[pos].cost + e.Weight
start_group[eto] = start_group[pos]
q.AddVal(eto, cfbs[pos].cost+e.Weight)
}
}
return start_group
}
func (g *Graph) AllDistance(base []int) []float64 {
q := prioque.NewMinSet()
cfbs := make([]cfb, len(g.Nodes))
for k, _ := range cfbs {
cfbs[k].cost = math.MaxFloat64
}
for _, v := range base {
cfbs[v].cost = 0.0
q.AddVal(v, 0.0)
}
for q.Len() > 0 {
pos := q.GetMin()
if cfbs[pos].flag {
continue
}
cfbs[pos].flag = true
for _, eid := range g.FromEdges[pos] {
e := g.Edges[eid]
eto := e.ToNode
if cfbs[eto].flag {
continue
}
if cfbs[eto].cost <= cfbs[pos].cost+e.Weight {
continue
}
cfbs[eto].cost = cfbs[pos].cost + e.Weight
q.AddVal(eto, cfbs[eto].cost)
}
}
cost := make([]float64, len(g.Nodes))
for k, v := range cfbs {
cost[k] = v.cost
}
return cost
}