-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathgraph.h
45 lines (33 loc) · 1.11 KB
/
graph.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
#ifndef GRAPH_H
#define GRAPH_H
#include <vector>
#include <map>
#include <set>
#include "pointgraph.h"
#include "fractions.h"
class Graph
{
public:
Graph();
explicit Graph(vector<vector<int>> matrix, bool min_task = true, bool comon_fractions = true);
//Проверка на корректность уравнений
bool getTask_is_true() const;
const vector<vector<Fractions> > &getRestrictions() const;
const set<PointGraph> &getNice_points() const;
bool getUp_restrictions() const;
bool getRight_restrictions() const;
bool getRound_restrictions() const;
const vector<pair<PointGraph, PointGraph> > &getMain_points() const;
private:
vector<vector<Fractions>> restrictions;
vector<vector<Fractions>> equations;
set<PointGraph> nice_points;
vector<pair<PointGraph, PointGraph>> main_points;
bool up_restrictions = false;
bool right_restrictions = false;
bool round_x_restrictions = false;
bool round_y_restrictions = false;
void generate_main_points();
void generate_points();
};
#endif // GRAPH_H