-
Notifications
You must be signed in to change notification settings - Fork 1
/
adaptivesystem.h
64 lines (56 loc) · 1.62 KB
/
adaptivesystem.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
/*
* AcoPath: Shortest path calculation using Ant Colony Optimization
* Copyright (C) 2014-2021 by Constantine Kyriakopoulos
* zfox@users.sourceforge.net
* @version 0.9.1
*
* @section LICENSE
*
* This program 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.
*
* This program 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 this program. If not, see <http://www.gnu.org/licenses/>.
*
*/
#ifndef ADAPTIVESYSTEM_H
#define ADAPTIVESYSTEM_H
#include <functional>
#include <vector>
#include <string>
#include <boost/property_tree/ptree.hpp>
#include <boost/property_tree/json_parser.hpp>
using boost::property_tree::ptree;
class AdaptiveSystem
{
public:
struct Edge
{
Edge();
int edgeStart;
int edgeEnd;
double weight;
long int id;
bool operator<(const Edge&) const;
bool operator>(const Edge&) const;
bool operator==(const Edge&) const;
};
AdaptiveSystem();
virtual ~AdaptiveSystem();
virtual std::vector<int> path(int, int) = 0;
virtual void insertEdge(int, int, double) noexcept(false);
virtual void clear() = 0;
protected:
virtual void initTopo(const std::string&);
std::vector<Edge> edges;
private:
static int edgeIdCnt;
};
#endif // ADAPTIVESYSTEM_H