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
|
/* RoutePlan.h
Copyright (c) 2022 by alextd
Endless Sky 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.
Endless Sky 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/>.
*/
#pragma once
#include "RouteEdge.h"
#include <vector>
class DistanceMap;
class PlayerInfo;
class Ship;
class System;
// RoutePlan is a wrapper for DistanceMap that uses a destination
// and keeps only the route to that system.
class RoutePlan {
public:
explicit RoutePlan(const System ¢er, const System &destination, const PlayerInfo *player = nullptr);
explicit RoutePlan(const Ship &ship, const System &destination, const PlayerInfo *player = nullptr);
// Find out if the destination is reachable.
bool HasRoute() const;
// Get the first step on the route from center to the destination.
const System *FirstStep() const;
// Find out how many days away the destination is.
int Days() const;
// How much fuel is needed to travel to this system along the route.
int RequiredFuel() const;
// Get the list of jumps to take to get to the destination.
std::vector<const System *> Plan() const;
// Get the list of jumps + fuel to take to get to the destination.
std::vector<std::pair<const System *, int>> FuelCosts() const;
private:
void Init(const DistanceMap &distance);
private:
// The final planned route. plan.front() is the destination.
std::vector<std::pair<const System *, RouteEdge>> plan;
bool hasRoute = false;
};
|
