blob: 187baf77fe42cf542513a3ea05c19a759a4f135b (
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
46
47
48
49
50
51
|
////////////////////////////////////////////////////////////////////////////////
// Copyright (C) 2018 Leo Tenenbaum
// This file is part of GraphColoring.
//
// GraphColoring is free software: you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Software Foundation, either version 3 of the License, or
// (at your option) any later version.
//
// GraphColoring is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU General Public License for more details.
//
// You should have received a copy of the GNU General Public License
// along with GraphColoring. If not, see <https://www.gnu.org/licenses/>.
////////////////////////////////////////////////////////////////////////////////
#ifndef GRAPHCOLORING_LEVELS_RULES_EDGERULE_H_
#define GRAPHCOLORING_LEVELS_RULES_EDGERULE_H_
#include "graphcoloring/graphs/graph.hpp"
#include "rules.hpp"
#include "rule.hpp"
namespace graphcoloring {
namespace rules {
class EdgeRule : public Rule {
public:
EdgeRule(gui::Color vertex_color1 = ANY_COLOR,
gui::Color vertex_color2 = ANY_COLOR,
gui::Color edge_color = ANY_COLOR);
EdgeRule(pugi::xml_node node, const ColorLoader& color_loader);
void LoadFromNode(pugi::xml_node node, const ColorLoader& color_loader);
bool ObeysRule(const Graph& graph) const;
int Render(gui::Window* window, int x, int y, int width) const;
virtual ~EdgeRule() {}
private:
bool ObeysRule(const Edge& edge) const;
gui::Color vertex_color1;
gui::Color vertex_color2;
gui::Color edge_color;
};
} // namespace rules
} // namespace graphcoloring
#endif // GRAPHCOLORING_LEVELS_RULES_EDGERULE_H_
|
