TTK
Loading...
Searching...
No Matches
ttk::MergeTreeDistance Member List

This is the complete list of members for ttk::MergeTreeDistance, including all inherited members.

assignmentSolverID_ttk::MergeTreeBaseprotected
barycenterMergeTree_ttk::MergeTreeBaseprotected
BaseClass()ttk::BaseClass
branchDecomposition_ttk::MergeTreeBaseprotected
branchDecompositionToTree(ftm::FTMTree_MT *tree)ttk::MergeTreeBaseinline
classicalPersistenceAssignmentProblem(ftm::FTMTree_MT *tree1, ftm::FTMTree_MT *tree2)ttk::MergeTreeDistanceinline
classicEditDistance(ftm::FTMTree_MT *tree1, ftm::FTMTree_MT *tree2, bool processTree1, bool computeEmptyTree, ftm::idNode nodeI, ftm::idNode nodeJ, std::vector< std::vector< dataType > > &treeTable, std::vector< std::vector< dataType > > &forestTable, std::vector< std::vector< std::tuple< int, int > > > &treeBackTable, std::vector< std::vector< std::vector< std::tuple< int, int > > > > &forestBackTable, int nRows, int nCols)ttk::MergeTreeDistanceinline
cleanTree_ttk::MergeTreeBaseprotected
computeBranchDecomposition(ftm::FTMTree_MT *tree, std::vector< std::vector< ftm::idNode > > &treeNodeMerged)ttk::MergeTreeBaseinline
computeDistance(ftm::FTMTree_MT *tree1, ftm::FTMTree_MT *tree2, std::vector< std::tuple< ftm::idNode, ftm::idNode, double > > &outputMatching)ttk::MergeTreeDistanceinline
computeDistance(ftm::FTMTree_MT *tree1, ftm::FTMTree_MT *tree2, std::vector< std::tuple< ftm::idNode, ftm::idNode > > &outputMatching)ttk::MergeTreeDistanceinline
ttk::MergeTreeBase::computeDistance(dataType x1, dataType x2, dataType y1, dataType y2, double power=2)ttk::MergeTreeBaseinline
computeEditDistance(ftm::FTMTree_MT *tree1, ftm::FTMTree_MT *tree2, std::vector< std::vector< dataType > > &treeTable, std::vector< std::vector< dataType > > &forestTable, std::vector< std::vector< std::tuple< int, int > > > &treeBackTable, std::vector< std::vector< std::vector< std::tuple< int, int > > > > &forestBackTable, int nRows, int nCols)ttk::MergeTreeDistanceinline
computeEmptyToForestDistance(ftm::FTMTree_MT *tree2, ftm::idNode nodeJ, int j, std::vector< std::vector< dataType > > &treeTable, std::vector< std::vector< dataType > > &forestTable)ttk::MergeTreeDistanceinline
computeEmptyToSubtreeDistance(ftm::FTMTree_MT *tree2, ftm::idNode nodeJ, int j, std::vector< std::vector< dataType > > &treeTable, std::vector< std::vector< dataType > > &forestTable)ttk::MergeTreeDistanceinline
computeForestsDistance(ftm::FTMTree_MT *tree1, ftm::FTMTree_MT *tree2, int i, int j, std::vector< std::vector< dataType > > &treeTable, std::vector< std::vector< dataType > > &forestTable, std::vector< std::vector< std::vector< std::tuple< int, int > > > > &forestBackTable, std::vector< ftm::idNode > &children1, std::vector< ftm::idNode > &children2)ttk::MergeTreeDistanceinline
computeForestToEmptyDistance(ftm::FTMTree_MT *tree1, ftm::idNode nodeI, int i, std::vector< std::vector< dataType > > &treeTable, std::vector< std::vector< dataType > > &forestTable)ttk::MergeTreeDistanceinline
computeMatching(ftm::FTMTree_MT *tree1, ftm::FTMTree_MT *tree2, std::vector< std::vector< std::tuple< int, int > > > &treeBackTable, std::vector< std::vector< std::vector< std::tuple< int, int > > > > &forestBackTable, std::vector< std::tuple< ftm::idNode, ftm::idNode, double > > &outputMatching, int startR, int startC)ttk::MergeTreeDistanceinline
computeSubtreesDistance(ftm::FTMTree_MT *tree1, ftm::FTMTree_MT *tree2, int i, int j, ftm::idNode nodeI, ftm::idNode nodeJ, std::vector< std::vector< dataType > > &treeTable, std::vector< std::vector< dataType > > &forestTable, std::vector< std::vector< std::tuple< int, int > > > &treeBackTable, std::vector< ftm::idNode > &children1, std::vector< ftm::idNode > &children2)ttk::MergeTreeDistanceinline
computeSubtreeToEmptyDistance(ftm::FTMTree_MT *tree1, ftm::idNode nodeI, int i, std::vector< std::vector< dataType > > &treeTable, std::vector< std::vector< dataType > > &forestTable)ttk::MergeTreeDistanceinline
computeTerm1_2(std::vector< ftm::idNode > &childrens, int ind, std::vector< std::vector< dataType > > &table, bool computeTerm1)ttk::MergeTreeDistanceinline
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
copyMinMaxPair(ftm::MergeTree< dataType > &mTree1, ftm::MergeTree< dataType > &mTree2, bool setOrigins=false)ttk::MergeTreeBaseinline
createCostMatrix(std::vector< std::vector< dataType > > &treeTable, std::vector< ftm::idNode > &children1, std::vector< ftm::idNode > &children2, std::vector< std::vector< dataType > > &costMatrix)ttk::MergeTreeDistanceinline
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
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(ftm::MergeTree< dataType > &mTree1, ftm::MergeTree< dataType > &mTree2, std::vector< std::tuple< ftm::idNode, ftm::idNode, double > > &outputMatching)ttk::MergeTreeDistanceinline
execute(ftm::MergeTree< dataType > &tree1, ftm::MergeTree< dataType > &tree2, std::vector< std::tuple< ftm::idNode, ftm::idNode > > &outputMatching)ttk::MergeTreeDistanceinline
fixMergedRootOrigin(ftm::FTMTree_MT *tree)ttk::MergeTreeBaseinline
forestAssignmentProblem(ftm::FTMTree_MT *ttkNotUsed(tree1), ftm::FTMTree_MT *ttkNotUsed(tree2), std::vector< std::vector< dataType > > &treeTable, std::vector< ftm::idNode > &children1, std::vector< ftm::idNode > &children2, std::vector< std::tuple< int, int > > &forestAssignment)ttk::MergeTreeDistanceinline
getParamNames(std::vector< std::string > &paramNames)ttk::MergeTreeBaseinline
getParamValueFromName(std::string &paramName)ttk::MergeTreeBaseinline
getSizeLimitMetric(std::vector< ftm::FTMTree_MT * > &trees)ttk::MergeTreeBaseinline
getThreadNumber() constttk::BaseClassinline
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
insertCost(ftm::FTMTree_MT *tree, ftm::idNode nodeId)ttk::MergeTreeBaseinline
isPersistenceDiagram_ttk::MergeTreeBaseprotected
keepMostImportantPairs(ftm::FTMTree_MT *tree, int n, bool useBD)ttk::MergeTreeBaseinline
keepSubtree_ttk::MergeTreeBaseprotected
lastLineModettk::Debugprotectedstatic
lastObject_ttk::BaseClassprotected
mergeSaddle(ftm::FTMTree_MT *tree, double epsilon, std::vector< std::vector< ftm::idNode > > &treeNodeMerged, bool mergeByPersistence=false)ttk::MergeTreeBaseinline
MergeTreeBase()ttk::MergeTreeBaseinline
MergeTreeDistance()ttk::MergeTreeDistanceinline
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
parallelEditDistance(ftm::FTMTree_MT *tree1, ftm::FTMTree_MT *tree2, std::vector< std::vector< dataType > > &treeTable, std::vector< std::vector< dataType > > &forestTable, std::vector< std::vector< std::tuple< int, int > > > &treeBackTable, std::vector< std::vector< std::vector< std::tuple< int, int > > > > &forestBackTable, int ttkNotUsed(nRows), int ttkNotUsed(nCols))ttk::MergeTreeDistanceinline
parallelEmptyTreeDistance_v2(ftm::FTMTree_MT *tree, bool isTree1, std::vector< ftm::idNode > &treeLeaves, std::vector< int > &treeNodeChildSize, std::vector< std::vector< dataType > > &treeTable, std::vector< std::vector< dataType > > &forestTable, std::vector< std::vector< std::tuple< int, int > > > &treeBackTable, std::vector< std::vector< std::vector< std::tuple< int, int > > > > &forestBackTable)ttk::MergeTreeDistanceinline
parallelEmptyTreeDistancePara(ftm::FTMTree_MT *tree, bool isTree1, std::vector< ftm::idNode > &treeLeaves, std::vector< int > &treeNodeChildSize, std::vector< std::vector< dataType > > &treeTable, std::vector< std::vector< dataType > > &forestTable, std::vector< std::vector< std::tuple< int, int > > > &treeBackTable, std::vector< std::vector< std::vector< std::tuple< int, int > > > > &forestBackTable, ftm::idNode nodeT, std::vector< int > &treeChildDone, std::vector< bool > &treeNodeDone, std::queue< ftm::idNode > &treeQueue)ttk::MergeTreeDistanceinline
parallelEmptyTreeDistanceTask(ftm::FTMTree_MT *tree, bool isTree1, std::vector< ftm::idNode > &ttkNotUsed(treeLeaves), std::vector< int > &treeNodeChildSize, std::vector< std::vector< dataType > > &treeTable, std::vector< std::vector< dataType > > &forestTable, std::vector< std::vector< std::tuple< int, int > > > &treeBackTable, std::vector< std::vector< std::vector< std::tuple< int, int > > > > &forestBackTable, ftm::idNode nodeT, std::vector< int > &treeChildDone, std::vector< bool > &treeNodeDone, std::queue< ftm::idNode > &treeQueue)ttk::MergeTreeDistanceinline
parallelize_ttk::MergeTreeBaseprotected
parallelTreeDistance_v2(ftm::FTMTree_MT *tree1, ftm::FTMTree_MT *tree2, bool isTree1, int i, std::vector< ftm::idNode > &tree1Leaves, std::vector< int > &tree1NodeChildSize, std::vector< ftm::idNode > &tree2Leaves, std::vector< int > &tree2NodeChildSize, std::vector< std::vector< dataType > > &treeTable, std::vector< std::vector< dataType > > &forestTable, std::vector< std::vector< std::tuple< int, int > > > &treeBackTable, std::vector< std::vector< std::vector< std::tuple< int, int > > > > &forestBackTable, bool firstCall=false)ttk::MergeTreeDistanceinline
parallelTreeDistancePara(ftm::FTMTree_MT *tree1, ftm::FTMTree_MT *tree2, bool isTree1, int i, std::vector< ftm::idNode > &tree1Leaves, std::vector< int > &tree1NodeChildSize, std::vector< ftm::idNode > &tree2Leaves, std::vector< int > &tree2NodeChildSize, std::vector< std::vector< dataType > > &treeTable, std::vector< std::vector< dataType > > &forestTable, std::vector< std::vector< std::tuple< int, int > > > &treeBackTable, std::vector< std::vector< std::vector< std::tuple< int, int > > > > &forestBackTable, bool firstCall, ftm::idNode nodeT, std::vector< int > &treeChildDone, std::vector< bool > &treeNodeDone, std::queue< ftm::idNode > &treeQueue)ttk::MergeTreeDistanceinline
parallelTreeDistanceTask(ftm::FTMTree_MT *tree1, ftm::FTMTree_MT *tree2, bool isTree1, int i, std::vector< ftm::idNode > &tree1Leaves, std::vector< int > &tree1NodeChildSize, std::vector< ftm::idNode > &tree2Leaves, std::vector< int > &tree2NodeChildSize, std::vector< std::vector< dataType > > &treeTable, std::vector< std::vector< dataType > > &forestTable, std::vector< std::vector< std::tuple< int, int > > > &treeBackTable, std::vector< std::vector< std::vector< std::tuple< int, int > > > > &forestBackTable, ftm::idNode nodeT, std::vector< int > &treeChildDone, std::vector< bool > &treeNodeDone, std::queue< ftm::idNode > &treeQueue)ttk::MergeTreeDistanceinline
persistenceMerging(ftm::FTMTree_MT *tree, double epsilon2, double epsilon3=100)ttk::MergeTreeBaseinline
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
postprocessAssignment(std::vector< MatchingType > &matchings, std::vector< ftm::idNode > &children1, std::vector< ftm::idNode > &children2, std::vector< std::tuple< int, int > > &forestAssignment)ttk::MergeTreeDistanceinline
postprocessingPipeline(ftm::FTMTree_MT *tree)ttk::MergeTreeBaseinline
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
printErr(const std::string &msg, const debug::LineMode &lineMode=debug::LineMode::NEW, std::ostream &stream=std::cerr) constttk::Debuginline
printMapIntInt(std::map< int, int > theMap)ttk::MergeTreeDistanceinline
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
putBackMergedNodes(ftm::FTMTree_MT *tree)ttk::MergeTreeBaseinline
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
runAssignmentProblemSolver(std::vector< std::vector< dataType > > &costMatrix, std::vector< MatchingType > &matchings)ttk::MergeTreeDistanceinline
setAssignmentSolver(int assignmentSolver)ttk::MergeTreeBaseinline
setAuctionEpsilon(double aucEpsilon)ttk::MergeTreeDistanceinline
setAuctionEpsilonDiviser(double aucEpsilonDiviser)ttk::MergeTreeDistanceinline
setAuctionNoRounds(double aucNoRounds)ttk::MergeTreeDistanceinline
setBarycenterMergeTree(bool imt)ttk::MergeTreeBaseinline
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
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::MergeTreeDistanceinline
setIsPersistenceDiagram(bool isPD)ttk::MergeTreeBaseinline
setKeepSubtree(bool keepSubtree)ttk::MergeTreeBaseinline
setMinMaxPairWeight(double weight)ttk::MergeTreeDistanceinline
setNodePerTask(int npt)ttk::MergeTreeBaseinline
setNormalizedWasserstein(bool normalizedWasserstein)ttk::MergeTreeBaseinline
setOnlyEmptyTreeDistance(double only)ttk::MergeTreeDistanceinline
setParallelize(bool para)ttk::MergeTreeBaseinline
setParamValueFromName(std::string &paramName, double value)ttk::MergeTreeBaseinline
setPersistenceThreshold(double pt)ttk::MergeTreeBaseinline
setPostprocess(bool postproc)ttk::MergeTreeDistanceinline
setPreprocess(bool preproc)ttk::MergeTreeDistanceinline
setSaveTree(bool save)ttk::MergeTreeDistanceinline
setTesting(bool test)ttk::MergeTreeDistanceinline
setThreadNumber(const int threadNumber)ttk::BaseClassinlinevirtual
setUseMinMaxPair(bool useMinMaxPair)ttk::MergeTreeBaseinline
setWrapper(const Wrapper *wrapper) overridettk::Debugvirtual
threadNumber_ttk::BaseClassmutableprotected
treesNodeCorr_ttk::MergeTreeBaseprotected
useDoubleInput_ttk::MergeTreeBaseprotected
useFullMerge_ttk::MergeTreeBaseprotected
useMinMaxPair_ttk::MergeTreeBaseprotected
verifyMergeTreeStructure(ftm::FTMTree_MT *tree)ttk::MergeTreeDistanceinline
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
~MergeTreeDistance() override=defaultttk::MergeTreeDistance