Distances utility class for counting paths and nodes. More...

#include <distances.h>

Public Member Functions
	distances (std::shared_ptr< cell > root)

int &	operator[] (const std::shared_ptr< cell > &cell) noexcept

void	set (std::shared_ptr< cell > cell, int distance) noexcept

bool	contains (const std::shared_ptr< cell > &cell) const noexcept

std::shared_ptr< distances >	path_to (std::shared_ptr< cell > goal) const noexcept

std::pair< std::shared_ptr< cell >, int >	max () const noexcept

void	collect_keys (std::vector< std::shared_ptr< cell > > &cells) const noexcept

Detailed Description

Distances utility class for counting paths and nodes.

This class is used to compute the distances between cells in a maze

The documentation for this class was generated from the following file:

Public Member Functions