-
Notifications
You must be signed in to change notification settings - Fork 0
/
graph.hpp
180 lines (146 loc) · 3.29 KB
/
graph.hpp
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
/**
* \file graph.hpp
* \brief Defines data structure of graphs.
*
* \author Haixing Hu
* Copyright (c) 2017 Haixing Hu. All rights reserved.
*/
#ifndef _GRAPH_HPP_
#define _GRAPH_HPP_
////////////////////////////////////////////////////////////////////////////////
#include <cstddef>
#include <vector>
#include <string>
#include <iostream>
#include <sstream>
#include <algorithm>
#include <cstdlib>
using namespace std;
class Node {
public:
Node() throw () {}
Node(size_t label) {
this->label = label;
}
size_t getLabel() const {
return label;
}
vector<size_t>& getNeighbours() {
return neighbours;
}
vector<size_t> const& getNeighbours() const {
return neighbours;
}
void addNeighbour(size_t label) {
neighbours.push_back(label);
}
bool operator<(Node const& other) const {
return (label < other.label);
}
friend ostream& operator<<(ostream& out, Node const& node) {
out << node.label << " ";
for (auto iter = node.neighbours.begin(); iter != node.neighbours.end(); ++iter) {
out << *iter << " ";
}
out << endl;
return out;
}
friend istream& operator>>(istream& in, Node& node) {
string line;
in >> node.label;
size_t v;
while (in >> v) {
node.neighbours.push_back(v);
}
return in;
}
private:
size_t label;
vector<size_t> neighbours;
};
class Graph {
public:
Graph() throw () {};
Graph(size_t n) {
for (size_t i = 0; i < n; ++i) {
addNode();
}
}
size_t size() {
return nodes.size();
}
Node& operator[](size_t label) {
return nodes[label];
}
Node const& operator[](size_t label) const {
return nodes[label];
}
vector<Node>& getNodes() {
return nodes;
}
vector<Node> const& getNodes() const {
return nodes;
}
vector<Node>::iterator begin() {
return nodes.begin();
}
vector<Node>::const_iterator begin() const {
return nodes.begin();
}
vector<Node>::iterator end() {
return nodes.end();
}
vector<Node>::const_iterator end() const {
return nodes.end();
}
Graph& addNode() {
Node node(nodes.size());
nodes.push_back(node);
return *this;
}
Graph& resize(size_t n) {
if (n < nodes.size()) {
nodes.resize(n);
} else if (n > nodes.size()) {
size_t m = nodes.size() - n;
for (size_t i = 0; i < m; ++i) {
addNode();
}
}
return *this;
}
Graph& normalize() {
sort(nodes.begin(), nodes.end());
for (auto iter = nodes.begin(); iter != nodes.end(); ++iter) {
vector<size_t>& neighbours = iter->getNeighbours();
sort(neighbours.begin(), neighbours.end());
}
return *this;
}
Graph& clear() {
nodes.clear();
return *this;
}
friend ostream& operator<<(ostream& out, Graph const& g) {
for (auto iter = g.nodes.begin(); iter != g.nodes.end(); ++iter) {
out << *iter;
}
return out;
}
friend istream& operator>>(istream& in, Graph& g) {
g.clear();
string line;
while (getline(in, line)) {
istringstream is(line);
Node node;
is >> node;
g.nodes.push_back(node);
}
g.normalize();
return in;
}
private:
vector<Node> nodes;
};
////////////////////////////////////////////////////////////////////////////////
#endif // _GRAPH_HPP_