forked from ifsmirnov/jngen
-
Notifications
You must be signed in to change notification settings - Fork 0
/
graph_builder_proxy.h
78 lines (59 loc) · 1.45 KB
/
graph_builder_proxy.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
#pragma once
#include <functional>
namespace jngen {
class Graph;
namespace graph_detail {
class GraphRandom;
struct Traits {
int n;
int m;
bool directed = false;
bool acyclic = false;
bool allowLoops = false;
bool allowMulti = false;
bool allowAntiparallel = false;
bool connected = false;
Traits() {}
explicit Traits(int n) : n(n) {}
Traits(int n, int m) : n(n), m(m) {}
};
class BuilderProxy {
public:
BuilderProxy(
Traits traits,
std::function<Graph(Traits)> builder) :
traits_(traits),
builder_(builder)
{ }
Graph g() const;
operator Graph() const;
BuilderProxy& allowLoops(bool value = true) {
traits_.allowLoops = value;
return *this;
}
BuilderProxy& allowMulti(bool value = true) {
traits_.allowMulti = value;
return *this;
}
BuilderProxy& allowAntiparallel(bool value = true) {
traits_.allowAntiparallel = value;
return *this;
}
BuilderProxy& connected(bool value = true) {
traits_.connected = value;
return *this;
}
BuilderProxy& directed(bool value = true) {
traits_.directed = value;
return *this;
}
BuilderProxy& acyclic(bool value = true) {
traits_.acyclic = value;
return *this;
}
private:
Traits traits_;
std::function<Graph(Traits)> builder_;
};
} // namespace graph_detail
} // namespace jngen