TTK
Loading...
Searching...
No Matches
ttk::MergeTreeClustering< dataType2 > Member List

This is the complete list of members for ttk::MergeTreeClustering< dataType2 >, including all inherited members.

addNodes(ftm::MergeTree< dataType > &mTree1, int noTrees, std::vector< std::tuple< ftm::idNode, ftm::idNode, int > > &nodesToProcess, std::vector< std::vector< std::tuple< ftm::idNode, ftm::idNode > > > &nodesProcessed)ttk::MergeTreeBarycenterinline
addNodes_ttk::MergeTreeBarycenterprotected
addScaledDeletedNodesCost(std::vector< ftm::FTMTree_MT * > &oriTrees, std::vector< std::vector< ftm::idNode > > &deletedNodes, std::vector< dataType > &distances)ttk::MergeTreeBarycenterinline
allDistanceTime_ttk::MergeTreeBarycenterprotected
alpha_ttk::MergeTreeBarycenterprotected
assignment(std::vector< ftm::FTMTree_MT * > &trees, ftm::MergeTree< dataType > &baryMergeTree, std::vector< std::vector< std::tuple< ftm::idNode, ftm::idNode, double > > > &matchings, std::vector< dataType > &distances, bool useDoubleInput=false, bool isFirstInput=true)ttk::MergeTreeBarycenterinline
assignmentCentroids(std::vector< ftm::FTMTree_MT * > &trees, std::vector< ftm::MergeTree< dataType > > &centroids, std::vector< std::tuple< int, int > > &assignmentC, std::vector< dataType > &bestDistanceT, std::vector< ftm::FTMTree_MT * > &trees2, std::vector< ftm::MergeTree< dataType > > &centroids2)ttk::MergeTreeClustering< dataType2 >inline
assignmentCentroidsAccelerated(std::vector< ftm::FTMTree_MT * > &trees, std::vector< ftm::MergeTree< dataType > > &centroids, std::vector< std::tuple< int, int > > &assignmentC, std::vector< dataType > &bestDistanceT, std::vector< ftm::FTMTree_MT * > &trees2, std::vector< ftm::MergeTree< dataType > > &centroids2)ttk::MergeTreeClustering< dataType2 >inline
assignmentCentroidsNaive(std::vector< ftm::FTMTree_MT * > &trees, std::vector< ftm::MergeTree< dataType > > &centroids, std::vector< std::tuple< int, int > > &assignmentC, std::vector< dataType > &bestDistanceT, std::vector< ftm::FTMTree_MT * > &trees2, std::vector< ftm::MergeTree< dataType > > &centroids2)ttk::MergeTreeClustering< dataType2 >inline
assignmentPara(std::vector< ftm::FTMTree_MT * > &trees, ftm::MergeTree< dataType > &baryMergeTree, std::vector< std::vector< std::tuple< ftm::idNode, ftm::idNode, double > > > &matchings, std::vector< dataType > &distances, bool useDoubleInput=false, bool isFirstInput=true)ttk::MergeTreeBarycenterinline
assignmentSolverID_ttk::MergeTreeBaseprotected
assignmentTask(std::vector< ftm::FTMTree_MT * > &trees, ftm::MergeTree< dataType > &baryMergeTree, std::vector< std::vector< std::tuple< ftm::idNode, ftm::idNode, double > > > &matchings, std::vector< dataType > &distances, bool useDoubleInput=false, bool isFirstInput=true)ttk::MergeTreeBarycenterinline
barycenterMaximumNumberOfPairs_ttk::MergeTreeBarycenterprotected
barycenterMergeTree_ttk::MergeTreeBaseprotected
barycenterSizeLimitPercent_ttk::MergeTreeBarycenterprotected
BaseClass()ttk::BaseClass
branchDecomposition_ttk::MergeTreeBaseprotected
branchDecompositionToTree(ftm::FTMTree_MT *tree)ttk::MergeTreeBaseinline
cleanTree_ttk::MergeTreeBaseprotected
computeBarycenter(std::vector< ftm::FTMTree_MT * > &trees, ftm::MergeTree< dataType > &baryMergeTree, std::vector< double > &alphas, std::vector< std::vector< std::tuple< ftm::idNode, ftm::idNode, double > > > &finalMatchings, bool finalAsgnDoubleInput=false, bool finalAsgnFirstInput=true)ttk::MergeTreeBarycenterinline
computeBranchDecomposition(ftm::FTMTree_MT *tree, std::vector< std::vector< ftm::idNode > > &treeNodeMerged)ttk::MergeTreeBaseinline
computeCentroids(std::vector< ftm::FTMTree_MT * > &trees, std::vector< ftm::MergeTree< dataType > > &centroids, matchingVectorType &outputMatching, std::vector< double > &alphas, std::vector< int > &clusteringAssignment, std::vector< ftm::FTMTree_MT * > &trees2, std::vector< ftm::MergeTree< dataType > > &centroids2, matchingVectorType &outputMatching2)ttk::MergeTreeClustering< dataType2 >inline
computeDistance(dataType x1, dataType x2, dataType y1, dataType y2, double power=2)ttk::MergeTreeBaseinline
computeOneBarycenter(std::vector< ftm::FTMTree_MT * > &trees, ftm::MergeTree< dataType > &baryMergeTree, std::vector< double > &alphas, std::vector< std::vector< std::tuple< ftm::idNode, ftm::idNode, double > > > &finalMatchings)ttk::MergeTreeClustering< dataType2 >inline
computeOneDistance(ftm::FTMTree_MT *tree, ftm::FTMTree_MT *baryTree, std::vector< std::tuple< ftm::idNode, ftm::idNode, double > > &matching, dataType &distance, bool useDoubleInput=false, bool isFirstInput=true)ttk::MergeTreeBarycenterinline
computeOneDistance(ftm::FTMTree_MT *tree, ftm::MergeTree< dataType > &baryMergeTree, std::vector< std::tuple< ftm::idNode, ftm::idNode, double > > &matching, dataType &distance, bool useDoubleInput=false, bool isFirstInput=true)ttk::MergeTreeBarycenterinline
computeOneDistance(ftm::MergeTree< dataType > &baryMergeTree, ftm::MergeTree< dataType > &baryMergeTree2, std::vector< std::tuple< ftm::idNode, ftm::idNode, double > > &matching, dataType &distance, bool useDoubleInput=false, bool isFirstInput=true)ttk::MergeTreeBarycenterinline
convertBranchDecompositionMatching(ftm::FTMTree_MT *tree1, ftm::FTMTree_MT *tree2, std::vector< std::tuple< ftm::idNode, ftm::idNode, double > > &outputMatching)ttk::MergeTreeBaseinline
convertBranchDecompositionMatching(ftm::FTMTree_MT *tree1, ftm::FTMTree_MT *tree2, std::vector< std::tuple< ftm::idNode, ftm::idNode > > &outputMatching)ttk::MergeTreeBaseinline
convertToDiagram_ttk::MergeTreeBaseprotected
copyCentroids(std::vector< ftm::MergeTree< dataType > > &centroids, std::vector< ftm::MergeTree< dataType > > &oldCentroids)ttk::MergeTreeClustering< dataType2 >inline
copyMinMaxPair(ftm::MergeTree< dataType > &mTree1, ftm::MergeTree< dataType > &mTree2, bool setOrigins=false)ttk::MergeTreeBaseinline
Debug()ttk::Debug
debugLevel_ttk::Debugmutableprotected
debugMsgNamePrefix_ttk::Debugprotected
debugMsgPrefix_ttk::Debugprotected
deleteCost(ftm::FTMTree_MT *tree, ftm::idNode nodeId)ttk::MergeTreeBaseinline
deleteMultiPersPairs(ftm::FTMTree_MT *tree, bool useBD)ttk::MergeTreeBaseinline
deleteMultiPersPairs_ttk::MergeTreeBaseprotected
deterministic_ttk::MergeTreeBarycenterprotected
distanceSquaredRoot_ttk::MergeTreeBaseprotected
dontUseMinMaxPair(ftm::FTMTree_MT *tree)ttk::MergeTreeBaseinline
epsilon1UseFarthestSaddle_ttk::MergeTreeBaseprotected
epsilon2Tree1_ttk::MergeTreeBaseprotected
epsilon2Tree2_ttk::MergeTreeBaseprotected
epsilon3Tree1_ttk::MergeTreeBaseprotected
epsilon3Tree2_ttk::MergeTreeBaseprotected
epsilonTree1_ttk::MergeTreeBaseprotected
epsilonTree2_ttk::MergeTreeBaseprotected
execute(std::vector< ftm::MergeTree< dataType > > &trees, matchingVectorType &outputMatching, std::vector< double > &alphas, std::vector< int > &clusteringAssignment, std::vector< ftm::MergeTree< dataType > > &trees2, matchingVectorType &outputMatching2, std::vector< ftm::MergeTree< dataType > > &centroids, std::vector< ftm::MergeTree< dataType > > &centroids2)ttk::MergeTreeClustering< dataType2 >inline
execute(std::vector< ftm::MergeTree< dataType > > &trees, matchingVectorType &outputMatching, std::vector< int > &clusteringAssignment, std::vector< ftm::MergeTree< dataType > > &trees2, matchingVectorType &outputMatching2, std::vector< ftm::MergeTree< dataType > > &centroids, std::vector< ftm::MergeTree< dataType > > &centroids2)ttk::MergeTreeClustering< dataType2 >inline
execute(std::vector< ftm::MergeTree< dataType > > &trees, matchingVectorType &outputMatching, std::vector< int > &clusteringAssignment, std::vector< ftm::MergeTree< dataType > > &centroids)ttk::MergeTreeClustering< dataType2 >inline
ttk::MergeTreeBarycenter::execute(std::vector< ftm::MergeTree< dataType > > &trees, std::vector< double > &alphas, std::vector< std::vector< std::tuple< ftm::idNode, ftm::idNode, double > > > &finalMatchings, ftm::MergeTree< dataType > &baryMergeTree, bool finalAsgnDoubleInput=false, bool finalAsgnFirstInput=true)ttk::MergeTreeBarycenterinline
ttk::MergeTreeBarycenter::execute(std::vector< ftm::MergeTree< dataType > > &trees, std::vector< std::vector< std::tuple< ftm::idNode, ftm::idNode, double > > > &finalMatchings, ftm::MergeTree< dataType > &baryMergeTree, bool finalAsgnDoubleInput=false, bool finalAsgnFirstInput=true)ttk::MergeTreeBarycenterinline
finalAssignmentCentroids(std::vector< ftm::FTMTree_MT * > &trees, std::vector< ftm::MergeTree< dataType > > &centroids, matchingVectorType &matchingsC, std::vector< std::tuple< int, int > > &assignmentC, std::vector< dataType > &bestDistanceT, std::vector< ftm::FTMTree_MT * > &trees2, std::vector< ftm::MergeTree< dataType > > &centroids2, matchingVectorType &matchingsC2)ttk::MergeTreeClustering< dataType2 >inline
finalDistances_ttk::MergeTreeBarycenterprotected
fixMergedRootOrigin(ftm::FTMTree_MT *tree)ttk::MergeTreeBaseinline
fixMergedRootOriginBarycenter(ftm::MergeTree< dataType > &barycenter)ttk::MergeTreeBarycenterinline
fixMergedRootOriginClustering(std::vector< ftm::MergeTree< dataType > > &centroids)ttk::MergeTreeClustering< dataType2 >inline
getAddDeletedNodesTime()ttk::MergeTreeBarycenterinline
getAllDistanceTime()ttk::MergeTreeBarycenterinline
getBestInitTreeIndex(std::vector< ftm::FTMTree_MT * > &trees, std::vector< ftm::FTMTree_MT * > &trees2, unsigned int barycenterMaximumNumberOfPairs, double sizeLimitPercent, bool distMinimizer=true)ttk::MergeTreeBarycenterinline
getBestInitTreeIndex(std::vector< ftm::FTMTree_MT * > &trees, std::vector< ftm::FTMTree_MT * > &trees2, double sizeLimitPercent, bool distMinimizer=true)ttk::MergeTreeBarycenterinline
getBestInitTreeIndex(std::vector< ftm::FTMTree_MT * > &trees, bool distMinimizer=true)ttk::MergeTreeBarycenterinline
getCentroidsDistanceMatrix(std::vector< ftm::MergeTree< dataType > > &centroids, std::vector< std::vector< double > > &distanceMatrix, bool useDoubleInput=false, bool isFirstInput=true)ttk::MergeTreeClustering< dataType2 >inline
getDistanceMatrix(std::vector< ftm::FTMTree_MT * > &trees, std::vector< ftm::FTMTree_MT * > &trees2, std::vector< std::vector< double > > &distanceMatrix, bool useDoubleInput=false, bool isFirstInput=true)ttk::MergeTreeBarycenterinline
getDistanceMatrix(std::vector< ftm::FTMTree_MT * > &trees, std::vector< std::vector< double > > &distanceMatrix, bool useDoubleInput=false, bool isFirstInput=true)ttk::MergeTreeBarycenterinline
getFinalDistances()ttk::MergeTreeBarycenterinline
getNodesAndScalarsToAdd(ftm::MergeTree< dataType > &ttkNotUsed(mTree1), ftm::idNode nodeId1, ftm::FTMTree_MT *tree2, ftm::idNode nodeId2, std::vector< dataType > &newScalarsVector, std::vector< std::tuple< ftm::idNode, ftm::idNode, int > > &nodesToProcess, ftm::idNode nodeCpt, int i)ttk::MergeTreeBarycenterinline
getParametrizedBirthDeath(ftm::FTMTree_MT *tree1, ftm::idNode nodeId1)ttk::MergeTreeBarycenterinline
getParametrizedDistanceMatrix(std::vector< ftm::FTMTree_MT * > &trees, std::vector< std::vector< double > > &distanceMatrix, unsigned int barycenterMaximumNumberOfPairs, double sizeLimitPercent, bool useDoubleInput=false, bool isFirstInput=true)ttk::MergeTreeBarycenterinline
getParamNames(std::vector< std::string > &paramNames)ttk::MergeTreeBaseinline
getParamValueFromName(std::string &paramName)ttk::MergeTreeBaseinline
getSizeLimitedDistanceMatrix(std::vector< ftm::FTMTree_MT * > &trees, std::vector< std::vector< double > > &distanceMatrix, unsigned int barycenterMaximumNumberOfPairs, double sizeLimitPercent, bool useDoubleInput=false, bool isFirstInput=true)ttk::MergeTreeBarycenterinline
getSizeLimitedTrees(std::vector< ftm::FTMTree_MT * > &trees, unsigned int barycenterMaximumNumberOfPairs, double sizeLimitPercent, std::vector< ftm::MergeTree< dataType > > &mTreesLimited)ttk::MergeTreeBarycenterinline
getSizeLimitMetric(std::vector< ftm::FTMTree_MT * > &trees)ttk::MergeTreeBaseinline
getThreadNumber() constttk::BaseClassinline
getTrees2NodeCorr()ttk::MergeTreeClustering< dataType2 >inline
getTreesNodeCorr()ttk::MergeTreeBaseinline
getTreesStats(std::vector< ftm::FTMTree_MT * > &trees, std::array< double, 3 > &stats)ttk::MergeTreeBaseinline
identifyRealMatching(ftm::FTMTree_MT *tree1, ftm::FTMTree_MT *tree2, std::vector< std::tuple< ftm::idNode, ftm::idNode > > &outputMatching, std::vector< std::tuple< ftm::idNode, ftm::idNode, bool > > &realMatching)ttk::MergeTreeBaseinline
initAcceleratedKMeans(std::vector< ftm::FTMTree_MT * > &trees, std::vector< ftm::MergeTree< dataType > > &centroids, std::vector< ftm::FTMTree_MT * > &trees2, std::vector< ftm::MergeTree< dataType > > &centroids2)ttk::MergeTreeClustering< dataType2 >inline
initAcceleratedKMeansVectors(std::vector< ftm::FTMTree_MT * > &trees, std::vector< ftm::MergeTree< dataType > > &centroids, std::vector< ftm::FTMTree_MT * > &ttkNotUsed(trees2))ttk::MergeTreeClustering< dataType2 >inline
initBarycenterTree(std::vector< ftm::FTMTree_MT * > &trees, ftm::MergeTree< dataType > &baryTree, bool distMinimizer=true)ttk::MergeTreeBarycenterinline
initCentroids(std::vector< ftm::FTMTree_MT * > &trees, std::vector< ftm::FTMTree_MT * > &trees2, std::vector< std::vector< ftm::MergeTree< dataType > > > &allCentroids)ttk::MergeTreeClustering< dataType2 >inline
initNewCentroid(std::vector< ftm::FTMTree_MT * > &trees, ftm::MergeTree< dataType > &centroid, int noNewCentroid)ttk::MergeTreeClustering< dataType2 >inline
insertCost(ftm::FTMTree_MT *tree, ftm::idNode nodeId)ttk::MergeTreeBaseinline
interpolation(ftm::MergeTree< dataType > &baryMergeTree, ftm::idNode nodeId, std::vector< dataType > &newScalarsVector, std::vector< ftm::FTMTree_MT * > &trees, std::vector< ftm::idNode > &nodes, std::vector< double > &alphas)ttk::MergeTreeBarycenterinline
interpolationAdded(ftm::FTMTree_MT *tree, ftm::idNode nodeId, double alpha, ftm::MergeTree< dataType > &baryMergeTree, ftm::idNode nodeB, std::vector< dataType > &newScalarsVector)ttk::MergeTreeBarycenterinline
isCalled_ttk::MergeTreeBarycenterprotected
isPersistenceDiagram_ttk::MergeTreeBaseprotected
keepMostImportantPairs(ftm::FTMTree_MT *tree, int n, bool useBD)ttk::MergeTreeBaseinline
keepSubtree_ttk::MergeTreeBaseprotected
lastLineModettk::Debugprotectedstatic
lastObject_ttk::BaseClassprotected
limitSizeBarycenter(ftm::MergeTree< dataType > &bary, std::vector< ftm::FTMTree_MT * > &trees, unsigned int barycenterMaximumNumberOfPairs, double percent, bool useBD=true)ttk::MergeTreeBarycenterinline
limitSizeBarycenter(ftm::MergeTree< dataType > &bary, std::vector< ftm::FTMTree_MT * > &trees, double percent, bool useBD=true)ttk::MergeTreeBarycenterinline
limitSizeBarycenter(ftm::MergeTree< dataType > &bary, std::vector< ftm::FTMTree_MT * > &trees, bool useBD=true)ttk::MergeTreeBarycenterinline
limitSizePercent(ftm::MergeTree< dataType > &bary, std::vector< ftm::FTMTree_MT * > &trees, double percent, bool useBD)ttk::MergeTreeBarycenterinline
matchingCorrespondence(treesMatchingVector &matchingT, std::vector< int > &nodeCorr, std::vector< int > &assignedTreesIndex)ttk::MergeTreeClustering< dataType2 >inline
mergeSaddle(ftm::FTMTree_MT *tree, double epsilon, std::vector< std::vector< ftm::idNode > > &treeNodeMerged, bool mergeByPersistence=false)ttk::MergeTreeBaseinline
MergeTreeBarycenter()ttk::MergeTreeBarycenterinline
MergeTreeBase()ttk::MergeTreeBaseinline
MergeTreeClustering()ttk::MergeTreeClustering< dataType2 >inline
mixDistances(dataType distance1, dataType distance2)ttk::MergeTreeBaseinline
mixDistancesMatrix(std::vector< std::vector< dataType > > &distanceMatrix, std::vector< std::vector< dataType > > &distanceMatrix2)ttk::MergeTreeBaseinline
mixDistancesMinMaxPairWeight(bool isFirstInput)ttk::MergeTreeBaseinline
mixDistancesWeight(bool isFirstInput)ttk::MergeTreeBaseinline
mixtureCoefficient_ttk::MergeTreeBaseprotected
mtFlattening(ftm::MergeTree< dataType > &mt)ttk::MergeTreeBaseinline
mtsFlattening(std::vector< ftm::MergeTree< dataType > > &mts)ttk::MergeTreeBaseinline
nodePerTask_ttk::MergeTreeBaseprotected
normalizedWasserstein_ttk::MergeTreeBaseprotected
parallelize_ttk::MergeTreeBaseprotected
persistenceMerging(ftm::FTMTree_MT *tree, double epsilon2, double epsilon3=100)ttk::MergeTreeBaseinline
persistenceScaling(std::vector< ftm::FTMTree_MT * > &trees, std::vector< ftm::MergeTree< dataType > > &mergeTrees, std::vector< ftm::FTMTree_MT * > &oriTrees, int iterationNumber, std::vector< std::vector< ftm::idNode > > &deletedNodes)ttk::MergeTreeBarycenterinline
persistenceThreshold_ttk::MergeTreeBaseprotected
persistenceThresholding(ftm::FTMTree_MT *tree, double persistenceThresholdT, std::vector< ftm::idNode > &deletedNodes)ttk::MergeTreeBaseinline
persistenceThresholding(ftm::FTMTree_MT *tree, std::vector< ftm::idNode > &deletedNodes)ttk::MergeTreeBaseinline
persistenceThresholding(ftm::FTMTree_MT *tree, double persistenceThresholdT)ttk::MergeTreeBaseinline
persistenceThresholding(ftm::FTMTree_MT *tree)ttk::MergeTreeBaseinline
postprocess_ttk::MergeTreeBarycenterprotected
postprocessingClustering(std::vector< ftm::MergeTree< dataType > > &trees, std::vector< ftm::MergeTree< dataType > > &centroids, matchingVectorType &outputMatching, std::vector< int > &clusteringAssignment)ttk::MergeTreeClustering< dataType2 >inline
postprocessingPipeline(ftm::FTMTree_MT *tree)ttk::MergeTreeBaseinline
preprocess_ttk::MergeTreeBarycenterprotected
preprocessingClustering(std::vector< ftm::MergeTree< dataType > > &trees, std::vector< std::vector< int > > &nodeCorr, bool useMinMaxPairT=true)ttk::MergeTreeClustering< dataType2 >inline
preprocessingPipeline(ftm::MergeTree< dataType > &mTree, double epsilonTree, double epsilon2Tree, double epsilon3Tree, bool branchDecompositionT, bool useMinMaxPairT, bool cleanTreeT, double persistenceThreshold, std::vector< int > &nodeCorr, bool deleteInconsistentNodes=true)ttk::MergeTreeBaseinline
preprocessingPipeline(ftm::MergeTree< dataType > &mTree, double epsilonTree, double epsilon2Tree, double epsilon3Tree, bool branchDecompositionT, bool useMinMaxPairT, bool cleanTreeT, std::vector< int > &nodeCorr, bool deleteInconsistentNodes=true)ttk::MergeTreeBaseinline
preprocessTree(ftm::FTMTree_MT *tree, bool deleteInconsistentNodes=true)ttk::MergeTreeBaseinline
printBaryStats(ftm::FTMTree_MT *baryTree, const debug::Priority &priority=debug::Priority::INFO)ttk::MergeTreeBarycenterinline
printCentroidsStats(std::vector< ftm::MergeTree< dataType > > &centroids, std::vector< ftm::MergeTree< dataType > > &centroids2)ttk::MergeTreeClustering< dataType2 >inline
printErr(const std::string &msg, const debug::LineMode &lineMode=debug::LineMode::NEW, std::ostream &stream=std::cerr) constttk::Debuginline
printMatching(std::vector< MatchingType > &matchings)ttk::MergeTreeBaseinline
printMatching(std::vector< std::tuple< ftm::idNode, ftm::idNode, double > > &matchings)ttk::MergeTreeBaseinline
printMatching(std::vector< std::tuple< ftm::idNode, ftm::idNode > > &matchings)ttk::MergeTreeBaseinline
printMsg(const std::string &msg, const debug::Priority &priority=debug::Priority::INFO, const debug::LineMode &lineMode=debug::LineMode::NEW, std::ostream &stream=std::cout) constttk::Debuginline
printMsg(const std::vector< std::string > &msgs, const debug::Priority &priority=debug::Priority::INFO, const debug::LineMode &lineMode=debug::LineMode::NEW, std::ostream &stream=std::cout) constttk::Debuginline
printMsg(const std::string &msg, const double &progress, const double &time, const int &threads, const double &memory, const debug::LineMode &lineMode=debug::LineMode::NEW, const debug::Priority &priority=debug::Priority::PERFORMANCE, std::ostream &stream=std::cout) constttk::Debuginline
printMsg(const std::string &msg, const double &progress, const double &time, const debug::LineMode &lineMode=debug::LineMode::NEW, const debug::Priority &priority=debug::Priority::PERFORMANCE, std::ostream &stream=std::cout) constttk::Debuginline
printMsg(const std::string &msg, const double &progress, const double &time, const int &threads, const debug::LineMode &lineMode=debug::LineMode::NEW, const debug::Priority &priority=debug::Priority::PERFORMANCE, std::ostream &stream=std::cout) constttk::Debuginline
printMsg(const std::string &msg, const double &progress, const debug::LineMode &lineMode=debug::LineMode::NEW, const debug::Priority &priority=debug::Priority::PERFORMANCE, std::ostream &stream=std::cout) constttk::Debuginline
printMsg(const std::string &msg, const double &progress, const debug::Priority &priority, const debug::LineMode &lineMode=debug::LineMode::NEW, std::ostream &stream=std::cout) constttk::Debuginline
printMsg(const std::vector< std::vector< std::string > > &rows, const debug::Priority &priority=debug::Priority::INFO, const bool hasHeader=true, const debug::LineMode &lineMode=debug::LineMode::NEW, std::ostream &stream=std::cout) constttk::Debuginline
printMsg(const debug::Separator &separator, const debug::LineMode &lineMode=debug::LineMode::NEW, const debug::Priority &priority=debug::Priority::INFO, std::ostream &stream=std::cout) constttk::Debuginline
printMsg(const debug::Separator &separator, const debug::Priority &priority, const debug::LineMode &lineMode=debug::LineMode::NEW, std::ostream &stream=std::cout) constttk::Debuginline
printMsg(const std::string &msg, const debug::Separator &separator, const debug::LineMode &lineMode=debug::LineMode::NEW, const debug::Priority &priority=debug::Priority::INFO, std::ostream &stream=std::cout) constttk::Debuginline
printMsgInternal(const std::string &msg, const std::string &right, const std::string &filler, const debug::Priority &priority=debug::Priority::INFO, const debug::LineMode &lineMode=debug::LineMode::NEW, std::ostream &stream=std::cout) constttk::Debuginlineprotected
printMsgInternal(const std::string &msg, const debug::Priority &priority, const debug::LineMode &lineMode, std::ostream &stream=std::cout) constttk::Debuginlineprotected
printOutputMatching(std::vector< std::tuple< ftm::idNode, ftm::idNode > > &outputMatching, ftm::FTMTree_MT *tree1, ftm::FTMTree_MT *tree2, bool computeCosts=true)ttk::MergeTreeBaseinline
printPairs(std::vector< std::tuple< SimplexId, SimplexId, dataType > > &treePairs)ttk::MergeTreeBaseinline
printTable(dataType *table, int nRows, int nCols)ttk::MergeTreeBaseinline
printTableVector(std::vector< std::vector< dataType > > &table)ttk::MergeTreeBaseinline
printTreesStats(std::vector< ftm::FTMTree_MT * > &trees)ttk::MergeTreeBaseinline
printTreesStats(std::vector< ftm::MergeTree< dataType > > &trees)ttk::MergeTreeBaseinline
printWrn(const std::string &msg, const debug::LineMode &lineMode=debug::LineMode::NEW, std::ostream &stream=std::cerr) constttk::Debuginline
progressiveBarycenter_ttk::MergeTreeBarycenterprotected
progressiveSpeedDivisor_ttk::MergeTreeBarycenterprotected
putBackMergedNodes(ftm::FTMTree_MT *tree)ttk::MergeTreeBaseinline
putBackMinMaxPair(std::vector< ftm::MergeTree< dataType > > &centroids, std::vector< ftm::MergeTree< dataType > > &centroids2)ttk::MergeTreeClustering< dataType2 >inline
relabelCost(ftm::FTMTree_MT *tree1, ftm::idNode nodeId1, ftm::FTMTree_MT *tree2, ftm::idNode nodeId2)ttk::MergeTreeBaseinline
relabelCostOnly(ftm::FTMTree_MT *tree1, ftm::idNode nodeId1, ftm::FTMTree_MT *tree2, ftm::idNode nodeId2)ttk::MergeTreeBaseinline
reverseNodeCorr(ftm::FTMTree_MT *tree, std::vector< int > &nodeCorr)ttk::MergeTreeBaseinline
samePreviousAssignment(int clusterId)ttk::MergeTreeClustering< dataType2 >inline
setAddNodes(bool addNodesT)ttk::MergeTreeBarycenterinline
setAlpha(double alpha)ttk::MergeTreeBarycenterinline
setAssignmentSolver(int assignmentSolver)ttk::MergeTreeBaseinline
setBarycenterMaximumNumberOfPairs(unsigned int maxi)ttk::MergeTreeBarycenterinline
setBarycenterMergeTree(bool imt)ttk::MergeTreeBaseinline
setBarycenterSizeLimitPercent(double percent)ttk::MergeTreeBarycenterinline
setBranchDecomposition(bool useBD)ttk::MergeTreeBaseinline
setCleanTree(bool clean)ttk::MergeTreeBaseinline
setDebugLevel(const int &debugLevel)ttk::Debugvirtual
setDebugMsgPrefix(const std::string &prefix)ttk::Debuginline
setDeleteMultiPersPairs(bool deleteMultiPersPairsT)ttk::MergeTreeBaseinline
setDeterministic(bool deterministicT)ttk::MergeTreeBarycenterinline
setDistanceSquaredRoot(bool distanceSquaredRoot)ttk::MergeTreeBaseinline
setEpsilon1UseFarthestSaddle(bool b)ttk::MergeTreeBaseinline
setEpsilon2Tree1(double epsilon)ttk::MergeTreeBaseinline
setEpsilon2Tree2(double epsilon)ttk::MergeTreeBaseinline
setEpsilon3Tree1(double epsilon)ttk::MergeTreeBaseinline
setEpsilon3Tree2(double epsilon)ttk::MergeTreeBaseinline
setEpsilonTree1(double epsilon)ttk::MergeTreeBaseinline
setEpsilonTree2(double epsilon)ttk::MergeTreeBaseinline
setIsCalled(bool ic)ttk::MergeTreeBarycenterinline
setIsPersistenceDiagram(bool isPD)ttk::MergeTreeBaseinline
setKeepSubtree(bool keepSubtree)ttk::MergeTreeBaseinline
setMixtureCoefficient(double coef)ttk::MergeTreeClustering< dataType2 >inline
setNoCentroids(unsigned int noCentroidsT)ttk::MergeTreeClustering< dataType2 >inline
setNodePerTask(int npt)ttk::MergeTreeBaseinline
setNormalizedWasserstein(bool normalizedWasserstein)ttk::MergeTreeBaseinline
setParallelize(bool para)ttk::MergeTreeBaseinline
setParamValueFromName(std::string &paramName, double value)ttk::MergeTreeBaseinline
setPersistenceThreshold(double pt)ttk::MergeTreeBaseinline
setPostprocess(bool postproc)ttk::MergeTreeBarycenterinline
setPreprocess(bool preproc)ttk::MergeTreeBarycenterinline
setProgressiveBarycenter(bool progressive)ttk::MergeTreeBarycenterinline
setProgressiveSpeedDivisor(double progSpeed)ttk::MergeTreeBarycenterinline
setThreadNumber(const int threadNumber)ttk::BaseClassinlinevirtual
setTol(double tolT)ttk::MergeTreeBarycenterinline
setUseMinMaxPair(bool useMinMaxPair)ttk::MergeTreeBaseinline
setWrapper(const Wrapper *wrapper) overridettk::Debugvirtual
threadNumber_ttk::BaseClassmutableprotected
tol_ttk::MergeTreeBarycenterprotected
treesNodeCorr_ttk::MergeTreeBaseprotected
updateBarycenterTree(std::vector< ftm::FTMTree_MT * > &trees, ftm::MergeTree< dataType > &baryMergeTree, std::vector< double > &alphas, std::vector< std::vector< std::tuple< ftm::idNode, ftm::idNode, double > > > &matchings)ttk::MergeTreeBarycenterinline
updateBarycenterTreeScalars(std::vector< ftm::FTMTree_MT * > &trees, ftm::MergeTree< dataType > &baryMergeTree, std::vector< double > &alphas, unsigned int indexAddedNodes, std::vector< std::vector< std::tuple< ftm::idNode, ftm::idNode, double > > > &matchings)ttk::MergeTreeBarycenterinline
updateBarycenterTreeStructure(std::vector< ftm::FTMTree_MT * > &trees, ftm::MergeTree< dataType > &baryMergeTree, std::vector< std::vector< std::tuple< ftm::idNode, ftm::idNode, double > > > &matchings)ttk::MergeTreeBarycenterinline
updateCentroids(std::vector< ftm::FTMTree_MT * > &trees, std::vector< ftm::MergeTree< dataType > > &centroids, std::vector< double > &alphas, std::vector< std::tuple< int, int > > &assignmentC)ttk::MergeTreeClustering< dataType2 >inline
updateNodesAndScalars(ftm::MergeTree< dataType > &mTree1, int noTrees, std::vector< std::tuple< ftm::idNode, ftm::idNode, int > > &nodesToProcess, std::vector< dataType > &newScalarsVector, std::vector< std::vector< std::tuple< ftm::idNode, ftm::idNode > > > &nodesProcessed)ttk::MergeTreeBarycenterinline
useDoubleInput_ttk::MergeTreeBaseprotected
useFullMerge_ttk::MergeTreeBaseprotected
useMinMaxPair_ttk::MergeTreeBaseprotected
verifyBarycenterTwoTrees(std::vector< ftm::FTMTree_MT * > &trees, ftm::MergeTree< dataType > &baryMergeTree, std::vector< std::vector< std::tuple< ftm::idNode, ftm::idNode, double > > > &finalMatchings, std::vector< dataType > distances)ttk::MergeTreeBarycenterinline
verifyOrigins(ftm::FTMTree_MT *tree)ttk::MergeTreeBaseinline
verifyPairsTree(ftm::FTMTree_MT *tree)ttk::MergeTreeBaseinline
wassersteinPower_ttk::MergeTreeBaseprotected
welcomeMsg(std::ostream &stream)ttk::Debugprotected
wrapper_ttk::BaseClassprotected
~BaseClass()=defaultttk::BaseClassvirtual
~Debug() overridettk::Debug
~MergeTreeBarycenter() override=defaultttk::MergeTreeBarycenter
~MergeTreeClustering() override=defaultttk::MergeTreeClustering< dataType2 >