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

Node cleanup and mapping for tree-building version. More...

#include <shortest_path_common.H>

Public Member Functions
void	operator() (const GT &, typename GT::Node *p) const noexcept

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

Node cleanup and mapping for tree-building version.

Definition at line 315 of file shortest_path_common.H.

Member Function Documentation

operator()()

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 >::Destroy_Tree_Node::operator() ( const GT &  , typename GT::Node *  p  ) const

inlinenoexcept

Definition at line 317 of file shortest_path_common.H.

References GraphCommon< GT, Node, Arc >::map_nodes(), NODE_COOKIE, SP_TREE_NODE_INFO, and SP_TREENODE.

---

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

• shortest_path_common.H