-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathGraphTypes.h
More file actions
138 lines (127 loc) · 3.14 KB
/
Copy pathGraphTypes.h
File metadata and controls
138 lines (127 loc) · 3.14 KB
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
# ifndef GRAPHTYPES_H
# define GRAPHTYPES_H
# include "numOp.h"
# include "Timer.h"
# include "FileOp.h"
# include "Distribution.h"
// A function that generates a random graph
class Rgraph
{
int N;
vector <int> ec;
map <pair <int, int>, int> m;
fstream fout;
default_random_engine generator;
public:
Rgraph();
void generate(int, Timer&, int);
void setCase(string&, int, int, int, int, string&);
};
// A class that generates weighted graph test cases
class Rwgraph
{
int N;
vector <int> ec;
map <pair <int, int>, int> m;
fstream fout;
default_random_engine generator;
public:
Rwgraph();
void generate(int, Timer&, int, int, int);
void setCase(string&, int, int, int, int, int, int, string&);
};
// A class that generates vertex weighted graph test cases
class Rvwgraph
{
int N;
vector <int> ec;
map <pair <int, int>, int> m;
fstream fout;
default_random_engine generator;
public:
Rvwgraph();
void generate(int, Timer&, int, int, int);
void setCase(string&, int, int, int, int, int, int, string&);
};
// A class that generates connected graph test cases
class Rconngraph
{
int N;
vector <int> ec;
map <pair <int, int>, int> m;
vector <pair <int, int> > edlist;
fstream fout;
default_random_engine generator;
public:
Rconngraph();
void generate(int, Timer&, int);
void setCase(string&, int, int, int, int, string&);
};
// A class that generates connected weighted graph test cases
class Rconnwgraph
{
int N;
vector <int> ec;
map <pair <int, int>, int> m;
vector <tuple <int, int, int> > edlist;
fstream fout;
default_random_engine generator;
public:
Rconnwgraph();
void generate(int, Timer&, int, int, int);
void setCase(string&, int, int, int, int, int, int, string&);
};
// A class that generates connected vertex weighted graph test cases
class Rconnvwgraph
{
int N;
vector <int> ec;
map <pair <int, int>, int> m;
vector <pair <int, int> > edlist;
fstream fout;
default_random_engine generator;
public:
Rconnvwgraph();
void generate(int, Timer&, int, int, int);
void setCase(string&, int, int, int, int, int, int, string&);
};
// A class that generates disconnected graph test cases
class Rdisgraph
{
int N;
map <pair <int, int>, int> m;
vector <pair <int, int> > edlist;
fstream fout;
default_random_engine generator;
public:
Rdisgraph();
void generate(int, vector <pair <int, int> >&, Timer&, vector <int>&);
void setCase(string&, int, int, int, int, string&);
};
// A class that generates edge-weighted disconnected graph test cases
class Rdiswgraph
{
int N;
map <pair <int, int>, int> m;
vector <tuple <int, int, int> > edlist;
fstream fout;
default_random_engine generator;
public:
Rdiswgraph();
void generate(int, vector <pair <int, int> >&, Timer&, vector <int>&, int, int);
void setCase(string&, int, int, int, int, int, int, string&);
};
// A class that generates vertex weighted disconnected graph test cases
class Rdisvwgraph
{
int N;
map <pair <int, int>, int> m;
vector <pair <int, int> > edlist;
fstream fout;
default_random_engine generator;
public:
Rdisvwgraph();
void generate(int, vector <pair <int, int> >&, Timer&, vector <int>&, int, int);
void setCase(string&, int, int, int, int, int, int, string&);
};
# endif