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

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

#include <shortest_path_common.H>

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

Public Attributes
Distance::Distance_Type	dist = 0
	Accumulated distance from start.
void *	heap_node = nullptr
	Handle in priority queue.
void *	ret_node = nullptr
	Parent node (for backtracking)

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 >::Node_Info

Information stored in node cookies for painting version.

Stores accumulated distance, heap handle, and parent pointer for path reconstruction.

Definition at line 196 of file shortest_path_common.H.

Member Data Documentation

dist

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 >::Node_Info::dist = 0

Accumulated distance from start.

Definition at line 198 of file shortest_path_common.H.

heap_node

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

void* Aleph::Shortest_Path_Base< GT, Distance, Itor, SA, HeapT >::Node_Info::heap_node = nullptr

Handle in priority queue.

Definition at line 199 of file shortest_path_common.H.

ret_node

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

void* Aleph::Shortest_Path_Base< GT, Distance, Itor, SA, HeapT >::Node_Info::ret_node = nullptr

Parent node (for backtracking)

Definition at line 200 of file shortest_path_common.H.

---

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

• shortest_path_common.H