User-Equilibrium-ADMM/utility.cpp at main · Fisher-007/User-Equilibrium-ADMM · GitHub

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
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
/*****************************************************************************
*  @file     utility.cpp                                                     *
*  @brief    工具类                                                          *
*  @details  包括最短路和图着色问题的求解                                    *
*  @author   Dong Yu                                                         *
*  @email    213191838@seu.edu.cn                                            *
*  @version  2.0                                                             *
*  @date     2022/11/13                                                      *
*                                                                            *
*----------------------------------------------------------------------------*
*  Change History :                                                          *
*  <Date>     | <Version> | <Author>       | <Description>                   *
*----------------------------------------------------------------------------*
*  2022/10/28 | 0.1       | Dong Yu        | Copy from User-Equilibrium v0.9 *
*----------------------------------------------------------------------------*
*  2022/10/31 | 1.0       | Dong Yu        | Added Link Blocking Method      *
*----------------------------------------------------------------------------*
*  2022/11/13 | 2.0       | Dong Yu        | Expanded Link Blocking Method   *
*----------------------------------------------------------------------------*
*                                                                            *
*****************************************************************************/
#include "stdafx.h"
#include "message.h"
#include "utility.h"


/**
* @brief For link blocking
* @param network 当前网络的副本
* @return 返回 link 的划分结果
* @retval 返回值中包括每一个 blocking 中的 link 集合
*/
vector<vector<int>> GetBlockingResult(const Network& network) {
	int id;
	Node node;
	set<int> checked_nodes, queuing_nodes;
	vector<int> link_color(network.get_all_links().size());
	vector<set<int>> node_color(network.get_all_nodes().size());

	queuing_nodes.insert(1);
	while (!queuing_nodes.empty()) {
		id = *queuing_nodes.begin();
		queuing_nodes.erase(id);
		node = network.get_node(id);

		for (int i = 0; i < node.preNode.size(); i++)
			if (!checked_nodes.count(node.preNode[i]))
				queuing_nodes.insert(node.preNode[i]);
		for (int i = 0; i < node.nextNode.size(); i++)
			if (!checked_nodes.count(node.nextNode[i]))
				queuing_nodes.insert(node.nextNode[i]);

		for (int i = 0; i < node.inLink.size(); i++) {
			if (link_color[node.inLink[i] - 1] == 0) {
				link_color[node.inLink[i] - 1] = 1;
				while ((node_color[id - 1].count(link_color[node.inLink[i] - 1]) == 1) ||
					(node_color[node.preNode[i] - 1].count(link_color[node.inLink[i] - 1]) == 1))
					link_color[node.inLink[i] - 1] += 1;
				node_color[id - 1].insert(link_color[node.inLink[i] - 1]);
				node_color[node.preNode[i] - 1].insert(link_color[node.inLink[i] - 1]);
			}
		}
		for (int i = 0; i < node.outLink.size(); i++) {
			if (link_color[node.outLink[i] - 1] == 0) {
				link_color[node.outLink[i] - 1] = 1;
				while ((node_color[id - 1].count(link_color[node.outLink[i] - 1]) == 1) ||
					(node_color[node.nextNode[i] - 1].count(link_color[node.outLink[i] - 1]) == 1))
					link_color[node.outLink[i] - 1] += 1;
				node_color[id - 1].insert(link_color[node.outLink[i] - 1]);
				node_color[node.nextNode[i] - 1].insert(link_color[node.outLink[i] - 1]);
			}
		}

		checked_nodes.insert(id);
	}

	vector<vector<int>> result(*max_element(link_color.begin(), link_color.end()));
	for (int i = 0; i < link_color.size(); i++)
		result[link_color[i] - 1].push_back(i + 1);
	return result;
}


vector<vector<int>> GetBlockingResultDefault(const Network& network) {
	vector<int> _blockResult = { 1,2,4,2,3,5,1,4,3,6,1,4,5,3,6,1,8,2,5,6,4,7,7,2,1,3,7,10,5,8,2,4,5,8,6,3,4,2,3,1,2,5,6,4,8,5,3,2,1,8,9,6,2,1,4,5,1,3,7,3,6,4,9,1,3,6,7,8,2,1,3,6,2,1,5,4 };
	vector<vector<int>> blockingResult(10);
	for (int i = 0; i < _blockResult.size(); i++)
		blockingResult[_blockResult[i] - 1].push_back(i + 1);
	return blockingResult;
}


vector<vector<int>> GetBlockingResultSimple(const Network& network) {
	int id;
	Link link;
	vector<int> link_color(network.get_all_links().size());
	vector<set<int>> node_color(network.get_all_nodes().size());

	for (int i = 0; i < link_color.size(); i++) {
		link = network.get_all_links()[i];
		link_color[i] = 1;
		while (node_color[link.head - 1].count(link_color[i]) == 1 || node_color[link.tail - 1].count(link_color[i]) == 1)
			link_color[i] += 1;
		node_color[link.head - 1].insert(link_color[i]);
		node_color[link.tail - 1].insert(link_color[i]);
	}

	vector<vector<int>> result(*max_element(link_color.begin(), link_color.end()));
	for (int i = 0; i < link_color.size(); i++)
		result[link_color[i] - 1].push_back(i + 1);
	return result;
}


vector<vector<int>> GetBlockingResultFixed(const Network& network) {
	int id, color_num, max_degree = 0;
	Link link;
	vector<Node> nodes = network.get_all_nodes();
	vector<vector<int>> node_color(nodes.size());
	vector<int> link_color_ptr(network.get_all_links().size(), -1);
	vector<int> link_color(network.get_all_links().size(), 0);

	// 寻找网络中最大的degree
	for (int i = 0; i < network.get_all_nodes().size(); i++)
		if (nodes[i].inLink.size() + nodes[i].outLink.size() > max_degree)
			max_degree = nodes[i].inLink.size() + nodes[i].outLink.size();

	// 染色数量从小到大尝试，使得划分的block数量尽可能少（范围可调）
	int i;
	for (color_num = max_degree; color_num <= max_degree + 1; color_num++) {

		for (int n = 0; n < nodes.size(); n++)
			node_color[n] = vector<int>(color_num, 0);

		for (i = 0; i < link_color_ptr.size(); i++) {
			if (i < 0) // 回溯到第一条link后，仍无可行解
				break;

			link_color_ptr[i] ++;
			link = network.get_all_links()[i];
			while (true) {
				if (link_color_ptr[i] < color_num) {
					if (node_color[link.head - 1][link_color_ptr[i]] > 0 || node_color[link.tail - 1][link_color_ptr[i]] > 0)
						link_color_ptr[i]++;
					else { // 找到可分配的颜色
						link_color[i] = link_color_ptr[i] + 1;
						node_color[link.head - 1][link_color_ptr[i]] ++;
						node_color[link.tail - 1][link_color_ptr[i]] ++;
						break;
					}
				}
				else { // 颜色超出给定范围则需要回溯
					link = network.get_all_links()[i - 1];
					link_color_ptr[i] = -1;
					if (i > 0) {
						node_color[link.head - 1][link_color_ptr[i - 1]] --;
						node_color[link.tail - 1][link_color_ptr[i - 1]] --;
						link_color[i - 1] = 0;
					}
					i -= 2;
					break;
				}
			}
		}

		if (i == link_color_ptr.size()) // 无可行解则继续尝试
			break;
	}

	if (i < 0)
		ExitMessage("Blocking Failed！");

	vector<vector<int>> result(color_num);
	for (int i = 0; i < link_color.size(); i++)
		result[link_color[i] - 1].push_back(i + 1);
	return result;
}


inline int cmp(const pair<int, int>& x, const pair<int, int>& y) {
	return x.second < y.second;
}

void sortMapByValue(map<int, int>& tMap, vector<pair<int, int>>& tVector) {
	for (map<int, int>::iterator curr = tMap.begin(); curr != tMap.end(); curr++)
		tVector.push_back(make_pair(curr->first, curr->second));

	sort(tVector.begin(), tVector.end(), cmp);
}

// 通过维护所有color数量的排序实现
vector<vector<int>> GetBlockingResultFixedEqu(const Network& network) {
	int id, color_num, max_degree = 0;
	Link link;
	vector<Node> nodes = network.get_all_nodes();
	vector<vector<int>> node_color(nodes.size());
	vector<int> link_color_ptr(network.get_all_links().size(), -1);
	vector<int> link_color(network.get_all_links().size(), 0);

	vector<int> link_color_list_ptr(network.get_all_links().size(), -1);
	vector<vector<pair<int, int>>> link_color_list(network.get_all_links().size());

	// 寻找网络中最大的degree
	for (int i = 0; i < network.get_all_nodes().size(); i++)
		if (nodes[i].inLink.size() + nodes[i].outLink.size() > max_degree)
			max_degree = nodes[i].inLink.size() + nodes[i].outLink.size();

	// 染色数量从小到大尝试，使得划分的block数量尽可能少（范围可调）
	int i;
	for (color_num = max_degree; color_num <= max_degree + 1; color_num++) {

		for (int n = 0; n < nodes.size(); n++)
			node_color[n] = vector<int>(color_num, 0);
		for (int l = 0; l < network.get_all_links().size(); l++) {
			link_color_list[l] = vector<pair<int, int>>(color_num);
			for (int k = 0; k < color_num; k++)
				link_color_list[l][k] = make_pair(k, 0);
		}

		for (i = 0; i < link_color_ptr.size(); i++) {
			if (i < 0) // 回溯到第一条link后，仍无可行解
				break;

			link_color_list_ptr[i]++;
			link_color_ptr[i] = link_color_list[i][link_color_list_ptr[i]].first;
			link = network.get_all_links()[i];
			while (true) {
				if (link_color_list_ptr[i] < color_num) {
					if (node_color[link.head - 1][link_color_ptr[i]] > 0 || node_color[link.tail - 1][link_color_ptr[i]] > 0) {
						link_color_list_ptr[i]++;
						link_color_ptr[i] = link_color_list[i][link_color_list_ptr[i]].first;
					}
					else { // 找到可分配的颜色
						link_color[i] = link_color_ptr[i] + 1;
						node_color[link.head - 1][link_color_ptr[i]]++;
						node_color[link.tail - 1][link_color_ptr[i]]++;

						if (i < link_color_ptr.size() - 1) {
							link_color_list[i + 1] = link_color_list[i];
							link_color_list[i + 1][link_color_list_ptr[i]].second++;
							sort(link_color_list[i + 1].begin(), link_color_list[i + 1].end(), cmp);
						}

						break;
					}
				}
				else { // 颜色超出给定范围则需要回溯
					link = network.get_all_links()[i - 1];
					link_color_list_ptr[i] = -1;
					link_color_ptr[i] = -1;
					if (i > 0) {
						link_color[i - 1] = 0;
						node_color[link.head - 1][link_color_ptr[i - 1]]--;
						node_color[link.tail - 1][link_color_ptr[i - 1]]--;
					}
					i -= 2;
					break;
				}
			}
		}

		if (i == link_color_ptr.size()) // 无可行解则继续尝试
			break;
	}

	if (i < 0)
		ExitMessage("Blocking Failed！");

	vector<vector<int>> result(color_num);
	for (int i = 0; i < link_color.size(); i++)
		result[link_color[i] - 1].push_back(i + 1);
	return result;
}