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 >::EdgeRec Struct Reference

Public Attributes

Nodeu
 
Nodev
 
Nodeedge_node
 

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

Definition at line 136 of file tpl_link_cut_tree_with_edges.H.

Member Data Documentation

◆ edge_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 >::EdgeRec::edge_node

Definition at line 140 of file tpl_link_cut_tree_with_edges.H.

◆ u

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 >::EdgeRec::u

Definition at line 138 of file tpl_link_cut_tree_with_edges.H.

◆ v

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 >::EdgeRec::v

Definition at line 139 of file tpl_link_cut_tree_with_edges.H.


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