Grid.h File Reference

Header file for the class GridMap, a map of cells with a cost of traversal, for the class template GridAdjacency, the free cells next to a cell of a GridMap, and for the class template Grid, which implements the Domain concept [see Domain.h] for pathfinding on a GridMap with 4 or 8 moves. More...

#include <algorithm>
#include <cmath>
#include <cstddef>
#include <cstdint>
#include <cstdlib>
#include <iosfwd>
#include <stdexcept>
#include <type_traits>
#include <vector>
#include "PBeFS/astar/Domain.h"
#include "PBeFS/astar/Structures.h"

Go to the source code of this file.

Classes
class	GridMap
	a rectangular map of cells, each with a cost of traversal More...
class	Grid< Moves >
	pathfinding on a GridMap with 4 (Moves == 4) or 8 (Moves == 8) moves More...

Namespaces
namespace	PBeFS_di_unipi_it
	namespace for the Parallel Best-First Search library

Variables
constexpr double	grid_sqrt2 = 1.41421356237309504880
	\( \sqrt{2} \), the cost of a diagonal move per unit of cost of a cell

Detailed Description

Header file for the class GridMap, a map of cells with a cost of traversal, for the class template GridAdjacency, the free cells next to a cell of a GridMap, and for the class template Grid, which implements the Domain concept [see Domain.h] for pathfinding on a GridMap with 4 or 8 moves.

The adjacency is that of the set of data structures [see Structures.h]: the one of the library, computed from the map, for the sets own, std and boost (neither the standard library nor Boost has a graph of a grid with blocked cells and diagonal moves, and a graph in compressed rows of the largest maps would take tens of GB), and the GridGraph of ADS for the set ads.

Author

Donato Meoli
Dipartimento di Informatica
Università di Pisa

Copyright

© by Donato Meoli