Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
Loading...
Searching...
No Matches
Aleph::Gen_Link_Cut_Tree_WithEdges< VT, ET, EdgeMonoid, LazyTag >::ExportData Struct Reference

Data stored in each exported Tree_Node. More...

#include <tpl_link_cut_tree_with_edges.H>

Public Attributes

Nodelct_node
 Back-pointer to the original LCT vertex handle.
 
VT vertex_value
 Stored payload associated with the vertex.
 
ET parent_edge
 Weight of the edge connecting this node to its parent.
 

Detailed Description

template<typename VT = int, typename ET = int, class EdgeMonoid = DefaultMonoid<ET>, class LazyTag = NoLazyTag<ET>>
struct Aleph::Gen_Link_Cut_Tree_WithEdges< VT, ET, EdgeMonoid, LazyTag >::ExportData

Data stored in each exported Tree_Node.

For the root node, parent_edge holds EdgeMonoid::identity().

Definition at line 459 of file tpl_link_cut_tree_with_edges.H.

Member Data Documentation

◆ lct_node

template<typename VT = int, typename ET = int, class EdgeMonoid = DefaultMonoid<ET>, class LazyTag = NoLazyTag<ET>>
Node* Aleph::Gen_Link_Cut_Tree_WithEdges< VT, ET, EdgeMonoid, LazyTag >::ExportData::lct_node

Back-pointer to the original LCT vertex handle.

Definition at line 461 of file tpl_link_cut_tree_with_edges.H.

◆ parent_edge

template<typename VT = int, typename ET = int, class EdgeMonoid = DefaultMonoid<ET>, class LazyTag = NoLazyTag<ET>>
ET Aleph::Gen_Link_Cut_Tree_WithEdges< VT, ET, EdgeMonoid, LazyTag >::ExportData::parent_edge

Weight of the edge connecting this node to its parent.

Definition at line 463 of file tpl_link_cut_tree_with_edges.H.

◆ vertex_value

template<typename VT = int, typename ET = int, class EdgeMonoid = DefaultMonoid<ET>, class LazyTag = NoLazyTag<ET>>
VT Aleph::Gen_Link_Cut_Tree_WithEdges< VT, ET, EdgeMonoid, LazyTag >::ExportData::vertex_value

Stored payload associated with the vertex.

Definition at line 462 of file tpl_link_cut_tree_with_edges.H.


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