blob: f687ff319e151f3329fc113e6503d9071f0de3b2 (
plain)
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
|
#ifndef GRAPH_H
#define GRAPH_H
#include <algorithm>
#include <unordered_map>
#include <unordered_set>
#include <vector>
class Graph {
public:
Graph() : vertices_(), graph_() {}
void add_vertex(int vertex) {
if (vertices_.find(vertex) == vertices_.end()) {
vertices_.insert(vertex);
graph_[vertex] = std::vector<int>();
}
}
void add_edge(int from, int to) {
add_vertex(from);
add_vertex(to);
graph_[from].push_back(to);
has_out_edges_.insert(from);
}
const std::set<int> & get_vertices() const {
return vertices_;
}
const std::vector<int> & get_neighbors(int vertex) const {
return graph_.find(vertex)->second;
}
bool has_out_edges(int vertex) const {
return has_out_edges_.count(vertex) > 0;
}
private:
std::set<int> vertices_;
std::unordered_map<int, std::vector<int>> graph_;
std::unordered_set<int> has_out_edges_;
};
#endif
|