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
|
/*
* Copyright (C) 2004-2025 by the Widelands Development Team
*
* 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 2
* 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 <https://www.gnu.org/licenses/>.
*
*/
#ifndef WL_ECONOMY_ROUTER_H
#define WL_ECONOMY_ROUTER_H
#include <cstdint>
#include <functional>
#include <vector>
#include "logic/map_objects/tribes/wareworker.h"
namespace Widelands {
class ITransportCostCalculator;
struct IRoute;
struct RoutingNode;
/**
* This class finds the best route between Nodes (Flags) in an economy.
* The functionality was split from Economy
*/
struct Router {
using ResetCycleFn = std::function<void()>;
explicit Router(const ResetCycleFn& reset);
bool find_route(RoutingNode& start,
RoutingNode& end,
IRoute* route,
WareWorker type,
int32_t cost_cutoff,
ITransportCostCalculator& cost_calculator);
bool find_nearest(std::vector<RoutingNode*> start_nodes,
RoutingNode& end,
IRoute* route,
WareWorker type,
ITransportCostCalculator& cost_calculator);
uint32_t assign_cycle();
private:
ResetCycleFn reset_;
uint32_t mpf_cycle{0U}; ///< pathfinding cycle, see Flag::mpf_cycle
};
} // namespace Widelands
#endif // end of include guard: WL_ECONOMY_ROUTER_H
|