Aleph::Zero_Heuristic< GT, Distance > Struct Template Reference

Default heuristic for A* (zero heuristic, degrades to Dijkstra). More...

#include <AStar.H>

Inheritance diagram for Aleph::Zero_Heuristic< GT, Distance >:

Public Types
using	Distance_Type = typename Distance::Distance_Type

Public Member Functions
Distance_Type	operator() (typename GT::Node *, typename GT::Node *) const

Detailed Description

template<class GT, class Distance = Dft_Dist<GT>>
struct Aleph::Zero_Heuristic< GT, Distance >

Default heuristic for A* (zero heuristic, degrades to Dijkstra).

This is a trivial heuristic that always returns 0. When used, A* behaves identically to Dijkstra's algorithm.

Template Parameters

GT	Graph type.
Distance	Distance accessor functor.

Definition at line 76 of file AStar.H.

Member Typedef Documentation

Distance_Type

template<class GT , class Distance = Dft_Dist<GT>>

using Aleph::Zero_Heuristic< GT, Distance >::Distance_Type = typename Distance::Distance_Type

Definition at line 78 of file AStar.H.

Member Function Documentation

operator()()

template<class GT , class Distance = Dft_Dist<GT>>

Distance_Type Aleph::Zero_Heuristic< GT, Distance >::operator() ( typename GT::Node *  , typename GT::Node *    ) const

inline

Definition at line 80 of file AStar.H.

---

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

• AStar.H