TTK fTRGraph propagation management with Fibonacci heaps.
More...
#include <FTRPropagation.h>
TTK fTRGraph propagation management with Fibonacci heaps.
- Author
- Gueunet Charles charl.nosp@m.es.g.nosp@m.ueune.nosp@m.t+tt.nosp@m.k@gma.nosp@m.il.c.nosp@m.om
- Date
- 2018-01-15
This class deal with scalar related operations: store them, compare them, ...
- See also
- ttk::FTRGraph
Definition at line 31 of file FTRPropagation.h.
◆ Propagation() [1/2]
ttk::ftr::Propagation::Propagation |
( |
idVertex |
startVert, |
|
|
const VertCompFN & |
vertComp, |
|
|
bool |
up |
|
) |
| |
|
inline |
◆ Propagation() [2/2]
ttk::ftr::Propagation::Propagation |
( |
const Propagation & |
other | ) |
|
|
delete |
◆ addNewVertex()
void ttk::ftr::Propagation::addNewVertex |
( |
const idVertex |
v | ) |
|
|
inline |
◆ clear()
void ttk::ftr::Propagation::clear |
( |
| ) |
|
|
inline |
◆ compare()
bool ttk::ftr::Propagation::compare |
( |
const idVertex |
a, |
|
|
const idVertex |
b |
|
) |
| const |
|
inline |
This comparison is reversed to the internal one because when we are growing, the natural order for the simplices is reversed to the order of the priority queue: We want the min to grow form lowest to highest
Definition at line 147 of file FTRPropagation.h.
◆ empty()
bool ttk::ftr::Propagation::empty |
( |
| ) |
const |
|
inline |
◆ find()
bool ttk::ftr::Propagation::find |
( |
idVertex |
v | ) |
const |
|
inline |
◆ getCurVertex()
idVertex ttk::ftr::Propagation::getCurVertex |
( |
| ) |
const |
|
inline |
◆ getId()
AtomicUF * ttk::ftr::Propagation::getId |
( |
| ) |
|
|
inline |
◆ getNbArcs()
idSuperArc ttk::ftr::Propagation::getNbArcs |
( |
| ) |
const |
|
inline |
◆ getNextVertex()
idVertex ttk::ftr::Propagation::getNextVertex |
( |
| ) |
const |
|
inline |
◆ goDown()
bool ttk::ftr::Propagation::goDown |
( |
| ) |
const |
|
inline |
◆ goUp()
bool ttk::ftr::Propagation::goUp |
( |
| ) |
const |
|
inline |
◆ lessArc()
void ttk::ftr::Propagation::lessArc |
( |
const idSuperArc |
a = 1 | ) |
|
|
inline |
◆ merge()
void ttk::ftr::Propagation::merge |
( |
Propagation & |
other | ) |
|
|
inline |
◆ moreArc()
void ttk::ftr::Propagation::moreArc |
( |
const idSuperArc |
a = 1 | ) |
|
|
inline |
◆ nextVertex()
idVertex ttk::ftr::Propagation::nextVertex |
( |
| ) |
|
|
inline |
◆ print()
std::string ttk::ftr::Propagation::print |
( |
| ) |
const |
|
inline |
◆ removeBelow()
◆ removeDuplicates()
void ttk::ftr::Propagation::removeDuplicates |
( |
const idVertex |
d | ) |
|
|
inline |
◆ setCurvert()
void ttk::ftr::Propagation::setCurvert |
( |
const idVertex |
v | ) |
|
|
inline |
◆ size()
std::size_t ttk::ftr::Propagation::size |
( |
| ) |
const |
|
inline |
The documentation for this class was generated from the following file: