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

Public Member Functions

bool operator== (const EdgeKey &) const noexcept=default
 

Public Attributes

Nodea
 
Nodeb
 

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

Definition at line 91 of file tpl_link_cut_tree_with_edges.H.

Member Function Documentation

◆ operator==()

template<typename VT = int, typename ET = int, class EdgeMonoid = DefaultMonoid<ET>, class LazyTag = NoLazyTag<ET>>
bool Aleph::Gen_Link_Cut_Tree_WithEdges< VT, ET, EdgeMonoid, LazyTag >::EdgeKey::operator== ( const EdgeKey ) const
defaultnoexcept

Member Data Documentation

◆ a

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 >::EdgeKey::a

Definition at line 93 of file tpl_link_cut_tree_with_edges.H.

◆ b

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 >::EdgeKey::b

Definition at line 94 of file tpl_link_cut_tree_with_edges.H.


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