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

Extended node info with tree node mapping. More...

#include <shortest_path_common.H>

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

Collaboration diagram for Aleph::Shortest_Path_Base< GT, Distance, Itor, SA, HeapT >::Tree_Node_Info:

Public Attributes
GT::Node *	tree_node = nullptr
	Corresponding node in spanning tree.
Public Attributes inherited from Aleph::Shortest_Path_Base< GT, Distance, Itor, SA, HeapT >::Node_Info
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 >::Tree_Node_Info

Extended node info with tree node mapping.

Used when building a separate spanning tree.

Definition at line 207 of file shortest_path_common.H.

Member Data Documentation

tree_node

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

GT::Node* Aleph::Shortest_Path_Base< GT, Distance, Itor, SA, HeapT >::Tree_Node_Info::tree_node = nullptr

Corresponding node in spanning tree.

Definition at line 209 of file shortest_path_common.H.

---

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

• shortest_path_common.H