Aleph::Shortest_Path_Base< GT, Distance, Itor, SA, HeapT >::Arc_Info Struct Reference

Information stored in arc cookies for painting version. More...

#include <shortest_path_common.H>

Inheritance diagram for Aleph::Shortest_Path_Base< GT, Distance, Itor, SA, HeapT >::Arc_Info:

Public Attributes
Distance::Distance_Type	pot = 0
	Arc potential (priority)

Detailed Description

template<class GT, class Distance, template< typename, class > class Itor, class SA, template< class, class, class > class HeapT>
struct Aleph::Shortest_Path_Base< GT, Distance, Itor, SA, HeapT >::Arc_Info

Information stored in arc cookies for painting version.

Stores the potential (priority) value used for heap ordering. For Dijkstra: pot = accumulated distance to target. For A*: pot = g(n) + h(n) (f-cost to target).

Definition at line 177 of file shortest_path_common.H.

Member Data Documentation

pot

template<class GT , class Distance , template< typename, class > class Itor, class SA , template< class, class, class > class HeapT>

Distance::Distance_Type Aleph::Shortest_Path_Base< GT, Distance, Itor, SA, HeapT >::Arc_Info::pot = 0

Arc potential (priority)

Definition at line 179 of file shortest_path_common.H.

---

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

• shortest_path_common.H