Implements the Dynamic Tree data-structure (or ST-Tree)
More...
#include <DynamicTree.h>
Implements the Dynamic Tree data-structure (or ST-Tree)
- 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
-
Jules Vidal jules.nosp@m..vid.nosp@m.al@li.nosp@m.p6.f.nosp@m.r
- Date
- 2019-09-15
Adapted by Jules Vidal from the ttk::ftr::DynamicGraph class from FTRGraph.h
- See also
- ttk::FTRGraph
Definition at line 66 of file DynamicTree.h.
◆ alloc()
| void ttk::DynamicTree::alloc |
( |
const std::size_t |
nbNodes | ) |
|
|
inline |
◆ getCCFromNode()
| std::size_t ttk::DynamicTree::getCCFromNode |
( |
const std::size_t |
n0 | ) |
const |
|
inline |
◆ getNbCC()
| size_t ttk::DynamicTree::getNbCC |
( |
| ) |
const |
|
inline |
◆ getNode() [1/2]
| DynTreeNode * ttk::DynamicTree::getNode |
( |
const std::size_t |
nid | ) |
|
|
inline |
◆ getNode() [2/2]
| const DynTreeNode * ttk::DynamicTree::getNode |
( |
const std::size_t |
nid | ) |
const |
|
inline |
◆ getNodeId()
| std::size_t ttk::DynamicTree::getNodeId |
( |
DynTreeNode * |
node | ) |
|
|
inline |
◆ insertEdge() [1/2]
| bool ttk::DynamicTree::insertEdge |
( |
const std::size_t |
n1, |
|
|
const std::size_t |
n2 |
|
) |
| |
|
inline |
inert or replace existing edge between n1 and n2
Definition at line 98 of file DynamicTree.h.
◆ insertEdge() [2/2]
- Returns
- true if we have merged two tree, false if it was just an intern operation
Definition at line 93 of file DynamicTree.h.
◆ print()
| std::string ttk::DynamicTree::print |
( |
| ) |
const |
◆ printNbCC()
| std::string ttk::DynamicTree::printNbCC |
( |
| ) |
const |
◆ removeEdge() [1/4]
| void ttk::DynamicTree::removeEdge |
( |
const std::size_t |
nid | ) |
|
|
inline |
remove the link btwn n and its parent
Definition at line 108 of file DynamicTree.h.
◆ removeEdge() [2/4]
| int ttk::DynamicTree::removeEdge |
( |
const std::size_t |
nid1, |
|
|
const std::size_t |
nid2 |
|
) |
| |
|
inline |
remove the edge btwn n1 and n2
- Returns
- 0 if not an edge
Definition at line 128 of file DynamicTree.h.
◆ removeEdge() [3/4]
| void ttk::DynamicTree::removeEdge |
( |
DynTreeNode *const |
n | ) |
|
|
inline |
remove the link btwn n and its parent
Definition at line 103 of file DynamicTree.h.
◆ removeEdge() [4/4]
remove the edge btwn n1 and n2
- Returns
- 0 if not an edge
Definition at line 114 of file DynamicTree.h.
◆ retrieveNbCC()
| void ttk::DynamicTree::retrieveNbCC |
( |
std::vector< size_t > & |
nbccIds | ) |
const |
|
inline |
The documentation for this class was generated from the following files:
- /home/julien/Pro/git/github/ttk-tierny/core/base/dynamicTree/DynamicTree.h
- /home/julien/Pro/git/github/ttk-tierny/core/base/dynamicTree/DynamicTree.cpp
