OpenTTD Source  20240919-master-gdf0233f4c2
pathfinder_type.h File Reference
#include "../tile_type.h"

Go to the source code of this file.

Data Structures

struct  FindDepotData
 Helper container to find a depot. More...
 

Variables

static const int YAPF_TILE_LENGTH = 100
 Length (penalty) of one tile with YAPF.
 
static const int YAPF_TILE_CORNER_LENGTH = 71
 Length (penalty) of a corner with YAPF.
 
static const int YAPF_INFINITE_PENALTY = 1000 * YAPF_TILE_LENGTH
 This penalty is the equivalent of "infinite", which means that paths that get this penalty will be chosen, but only if there is no other route without it. More...
 
static const int YAPF_ROADVEH_PATH_CACHE_SEGMENTS = 8
 Maximum segments of road vehicle path cache.
 
static const int YAPF_ROADVEH_PATH_CACHE_DESTINATION_LIMIT = 8
 Distance from destination road stops to not cache any further.
 

Detailed Description

General types related to pathfinders.

Definition in file pathfinder_type.h.

Variable Documentation

◆ YAPF_INFINITE_PENALTY

const int YAPF_INFINITE_PENALTY = 1000 * YAPF_TILE_LENGTH
static

This penalty is the equivalent of "infinite", which means that paths that get this penalty will be chosen, but only if there is no other route without it.

Be careful with not applying this penalty too often, or the total path cost might overflow.

Definition at line 27 of file pathfinder_type.h.

Referenced by YapfTrainFindNearestDepot().