22#ifndef TTK_ENABLE_KAMIKAZE
35 idVertex firstReg_{nullVertex}, lastReg_{nullVertex}, endV_{nullVertex};
44 : upNodeId_{up}, downNodeId_{down} {
58#ifndef TTK_ENABLE_KAMIKAZE
59 if(downNodeId_ == nullNode) {
60 this->
printErr(
"Arc have null down node");
71#ifndef TTK_ENABLE_KAMIKAZE
73 this->
printErr(
"Arc have null UF propagation");
84 bool const old = visible_;
96 if(firstReg_ == nullVertex)
106 if(endV_ == nullVertex) {
116 return firstReg_ == nullVertex;
128 if(merged_ == nullSuperArc) {
135 return merged_ != nullSuperArc;
144 merged_ = nullSuperArc;
148 return segmentation_;
152 return segmentation_;
Minimalist debugging class.
void setDebugMsgPrefix(const std::string &prefix)
int printErr(const std::string &msg, const debug::LineMode &lineMode=debug::LineMode::NEW, std::ostream &stream=std::cerr) const
Union find compliant with parallel find and maintaining the current local propagation inspired by ttk...
Propagation * getPropagation()
TTK fTRGraph propagation management with Fibonacci heaps.
TTK processing package that deal with segmentation of an arc in the Reeb Graph.
void visit(const idVertex v)
decltype(segmentation_) & segmentation()
void setUpNodeId(const idNode id)
void setUfProp(AtomicUF *const UFprop)
idSuperArc mergedIn() const
idNode getUpNodeId() const
idNode getDownNodeId() const
idVertex getLastReg() const
const decltype(segmentation_) & segmentation() const
idVertex getFirstReg() const
Propagation * getPropagation() const
void setEnd(const idVertex v)
void setDownNodeId(const idNode id)
SuperArc(const idNode down=nullNode, const idNode up=nullNode)
void merge(const idSuperArc arc)
long unsigned int idSuperArc
SuperArc index in vect_superArcs_.
SimplexId idVertex
Vertex index in scalars_.
unsigned int idNode
Node index in vect_nodes_.