-
Notifications
You must be signed in to change notification settings - Fork 9
/
Copy pathaon.h
94 lines (67 loc) · 2.11 KB
/
aon.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
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
#include "graph.h"
#include "cgraph.h"
#include <string>
#include <RcppParallel.h>
#include <Rcpp.h>
using namespace std;
using namespace RcppParallel;
struct aonGraph : public RcppParallel::Worker{
//input
Graph* m_gr;
IVec m_dep;
IVec m_arr;
DVec m_demand;
int algorithm;
//output
vector<double> m_result;
vector<pair<int, pair<vector<int>, vector<double>>>> m_od;
int n_iter;
// constructor
aonGraph(Graph* gr, IVec dep, IVec arr, DVec demand, int algo);
aonGraph(aonGraph &pn, RcppParallel::Split);
// algorithms
void dijkstra(std::size_t begin, std::size_t end);
void dijkstra_reverse(std::size_t begin, std::size_t end);
void bidir(std::size_t begin, std::size_t end);
void nba(std::size_t begin, std::size_t end);
void operator()(std::size_t begin, std::size_t end);
void join(aonGraph &pb);
};
struct aonGraphC : public RcppParallel::Worker{
//input
CGraph* m_gr;
Graph* m_or;
IVec m_dep;
IVec m_arr;
DVec m_demand;
int algorithm;
//output
vector<double> m_result;
vector<pair<int, pair<vector<int>, vector<double>>>> m_od;
int n_iter;
// constructor
aonGraphC(CGraph* gr, Graph* original_graph, IVec dep, IVec arr, DVec demand, int algo);
aonGraphC(aonGraphC &pn, RcppParallel::Split);
// algorithms
void dijkstra_bidir(std::size_t begin, std::size_t end);
void phast(std::size_t begin, std::size_t end);
// reverse
void phastr(std::size_t begin, std::size_t end);
void operator()(std::size_t begin, std::size_t end);
void join(aonGraphC &pb);
};
// disaggregate aon from contracted to normal graph
struct unpackC : public RcppParallel::Worker{
CGraph* m_gr; // just for use unpack method and shortcuts
Graph* m_or; // normal graph
Graph* m_cg; // full contracted graph
DVec m_input; // contracted aon output from aonGraphC
bool phast_rename;
DVec m_result; //normal graph aon
IVec node_dict;
unpackC(CGraph* gr, Graph* original, Graph* cg, DVec input, bool convert);
unpackC(unpackC &pn, RcppParallel::Split);
// iterate over m_cg->indG
void operator()(std::size_t begin, std::size_t end);
void join(unpackC &pb);
};