-
Notifications
You must be signed in to change notification settings - Fork 0
/
pathEdge.h
66 lines (53 loc) · 2.13 KB
/
pathEdge.h
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
/*
* BetaCome: betacome of future network routing
*
* Code to accompany the competition:
* huawei software challenge : future network routing,
* Yuanyuan Qin, Song Tang, Meiying Wu, 2016
*
* Copyright (C) 2016 Yuanyuan Qin, Peking University, Shenzhen, China
*
* This file is part of BetaCome.
*
* BetaCome is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* BetaCome is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with BetaCome. If not, see <http://www.gnu.org/licenses/>.
*
*/
#ifndef _PATH_EDGE_H
#define _PATH_EDGE_H
#include "path.h"
#include "graphVector.h"
#include <utility>
#include <unordered_map>
using namespace std;
class PathEdge
{
public:
PathEdge(){};
PathEdge(GraphVector &graph, Path &path){ refreshPathEdge(graph, path); };
PathEdge(GraphVector &graph, Path &path, PathEdge &otherPathEdge){ refreshPathEdge(graph, path, otherPathEdge); };
PathEdge(PathEdge &path1Edge, PathEdge &path2Edge);
~PathEdge(){};
int refreshPathEdge(GraphVector &graph, Path &path);
int refreshPathEdge(GraphVector &graph, Path &path, PathEdge &otherPathEdge);//concern other pathEdge's influence
int getEdgeWeightSum();
inline bool hasEdge(int uu, int vv) const { return pathUsedEdges.count(((uu << SHIFTSIXTEEN) + vv)); }
inline int getEdgeId(int uu, int vv) const { return pathUsedEdges.at(((uu << SHIFTSIXTEEN) + vv)).first; }
inline int getEdgeWeight(int uu, int vv) const { return pathUsedEdges.at(((uu << SHIFTSIXTEEN) + vv)).second; }
inline int getEdgeNum() const { return pathUsedEdges.size(); }
protected:
unordered_map<int, pair<int, int>> pathUsedEdges;//pair<edgeId,weight>
enum SHIFTNUM { SHIFTSIXTEEN = 16 };
private:
};
#endif