ttkMergeTreeAutoencoder.cpp

Go to the documentation of this file.

#include <MergeTreeAxesAlgorithmUtils.h>
#include <ttkMergeTreeAutoencoder.h>
#include <ttkMergeTreeAutoencoderUtils.h>
#include <ttkMergeTreeUtils.h>
#include <ttkMergeTreeVisualization.h>
 
#include <vtkInformation.h>
 
#include <vtkDataArray.h>
#include <vtkDataSet.h>
#include <vtkFloatArray.h>
#include <vtkObjectFactory.h>
#include <vtkPointData.h>
#include <vtkSmartPointer.h>
#include <vtkTable.h>
#include <vtkUnsignedIntArray.h>
 
#include <ttkMacros.h>
#include <ttkUtils.h>
 
// A VTK macro that enables the instantiation of this class via ::New()
// You do not have to modify this
vtkStandardNewMacro(ttkMergeTreeAutoencoder);
 
ttkMergeTreeAutoencoder::ttkMergeTreeAutoencoder() {
  this->SetNumberOfInputPorts(3);
  this->SetNumberOfOutputPorts(4);
}
 
int ttkMergeTreeAutoencoder::FillInputPortInformation(int port,
                                                      vtkInformation *info) {
  if(port == 0) {
    info->Set(vtkAlgorithm::INPUT_REQUIRED_DATA_TYPE(), "vtkMultiBlockDataSet");
  } else if(port == 1) {
    info->Set(vtkAlgorithm::INPUT_REQUIRED_DATA_TYPE(), "vtkMultiBlockDataSet");
    info->Set(vtkAlgorithm::INPUT_IS_OPTIONAL(), 1);
  } else if(port == 2) {
    info->Set(vtkAlgorithm::INPUT_REQUIRED_DATA_TYPE(), "vtkTable");
    info->Set(vtkAlgorithm::INPUT_IS_OPTIONAL(), 1);
  } else
    return 0;
  return 1;
}
 
int ttkMergeTreeAutoencoder::FillOutputPortInformation(int port,
                                                       vtkInformation *info) {
  if(port == 0 or port == 1 or port == 2 or port == 3) {
    info->Set(vtkDataObject::DATA_TYPE_NAME(), "vtkMultiBlockDataSet");
  } else {
    return 0;
  }
  return 1;
}
 
int ttkMergeTreeAutoencoder::RequestData(vtkInformation *ttkNotUsed(request),
                                         vtkInformationVector **inputVector,
                                         vtkInformationVector *outputVector) {
#ifndef TTK_ENABLE_TORCH
  TTK_FORCE_USE(inputVector);
  TTK_FORCE_USE(outputVector);
  printErr("This filter requires Torch.");
  return 0;
#else
  // ------------------------------------------------------------------------------------
  // --- Get input object from input vector
  // ------------------------------------------------------------------------------------
  auto blocks = vtkMultiBlockDataSet::GetData(inputVector[0], 0);
  auto blocks2 = vtkMultiBlockDataSet::GetData(inputVector[1], 0);
  auto table = vtkTable::GetData(inputVector[2], 0);
 
  // ------------------------------------------------------------------------------------
  // --- Load blocks
  // ------------------------------------------------------------------------------------
  std::vector<vtkSmartPointer<vtkMultiBlockDataSet>> inputTrees, inputTrees2;
  ttk::ftm::loadBlocks(inputTrees, blocks);
  ttk::ftm::loadBlocks(inputTrees2, blocks2);
 
  // Load table
  clusterAsgn_.clear();
  vtkAbstractArray *clusterAsgn;
  if(table) {
    clusterAsgn = this->GetInputArrayToProcess(0, inputVector);
    if(clusterAsgn) {
      clusterAsgn_.resize(clusterAsgn->GetNumberOfValues());
      for(unsigned int i = 0; i < clusterAsgn_.size(); ++i)
        clusterAsgn_[i] = clusterAsgn->GetVariantValue(i).ToInt();
    }
  }
  if((not table or not clusterAsgn) and clusteringLossWeight_ != 0) {
    printErr(
      "You must provide a table column in info input to use clustering loss");
    return 0;
  }
  if(clusteringLossWeight_ != 0) {
    std::stringstream ss;
    for(auto &e : clusterAsgn_)
      ss << e << " ";
    printMsg(ss.str());
  }
 
  // ------------------------------------------------------------------------------------
  // If we have already computed once but the input has changed
  if((treesNodes.size() != 0 and inputTrees[0]->GetBlock(0) != treesNodes[0])
     or (treesNodes2.size() != inputTrees2.size()))
    resetDataVisualization();
 
  // Parameters
  branchDecomposition_ = true;
  if(not normalizedWasserstein_) {
    oldEpsilonTree1 = epsilonTree1_;
    epsilonTree1_ = 100;
  } else
    epsilonTree1_ = oldEpsilonTree1;
  if(normalizedWasserstein_)
    printMsg("Computation with normalized Wasserstein.");
  else
    printMsg("Computation without normalized Wasserstein.");
 
  return run(outputVector, inputTrees, inputTrees2);
#endif
}
 
#ifdef TTK_ENABLE_TORCH
int ttkMergeTreeAutoencoder::run(
  vtkInformationVector *outputVector,
  std::vector<vtkSmartPointer<vtkMultiBlockDataSet>> &inputTrees,
  std::vector<vtkSmartPointer<vtkMultiBlockDataSet>> &inputTrees2) {
  runCompute(outputVector, inputTrees, inputTrees2);
  runOutput(outputVector, inputTrees, inputTrees2);
  return 1;
}
 
int ttkMergeTreeAutoencoder::runCompute(
  vtkInformationVector *ttkNotUsed(outputVector),
  std::vector<vtkSmartPointer<vtkMultiBlockDataSet>> &inputTrees,
  std::vector<vtkSmartPointer<vtkMultiBlockDataSet>> &inputTrees2) {
  // ------------------------------------------------------------------------------------
  // --- Construct trees
  // ------------------------------------------------------------------------------------
  std::vector<ttk::ftm::MergeTree<float>> intermediateMTrees,
    intermediateMTrees2;
 
  bool useSadMaxPairs = (mixtureCoefficient_ == 0);
  isPersistenceDiagram_ = ttk::ftm::constructTrees<float>(
    inputTrees, intermediateMTrees, treesNodes, treesArcs, treesSegmentation,
    useSadMaxPairs);
  // If merge trees are provided in input and normalization is not asked
  convertToDiagram_
    = (not isPersistenceDiagram_ and not normalizedWasserstein_);
  if(not isPersistenceDiagram_
     or (mixtureCoefficient_ != 0 and mixtureCoefficient_ != 1)) {
    auto &inputTrees2ToUse
      = (not isPersistenceDiagram_ ? inputTrees2 : inputTrees);
    ttk::ftm::constructTrees<float>(inputTrees2ToUse, intermediateMTrees2,
                                    treesNodes2, treesArcs2, treesSegmentation2,
                                    !useSadMaxPairs);
  }
  isPersistenceDiagram_ |= (not normalizedWasserstein_);
 
  const int numInputs = intermediateMTrees.size();
  const int numInputs2 = intermediateMTrees2.size();
  setDataVisualization(numInputs, numInputs2);
 
  // ------------------------------------------------------------------------------------
  // --- Call base
  // ------------------------------------------------------------------------------------
  execute(intermediateMTrees, intermediateMTrees2);
 
  ttk::ftm::mergeTreesTemplateToDouble<float>(
    intermediateMTrees, intermediateDTrees);
 
  return 1;
}
 
// TODO manage double input
int ttkMergeTreeAutoencoder::runOutput(
  vtkInformationVector *outputVector,
  std::vector<vtkSmartPointer<vtkMultiBlockDataSet>> &inputTrees,
  std::vector<vtkSmartPointer<vtkMultiBlockDataSet>> &ttkNotUsed(inputTrees2)) {
  if(not createOutput_)
    return 1;
  // ------------------------------------------------------------------------------------
  // --- Create output
  // ------------------------------------------------------------------------------------
  auto output_origins = vtkMultiBlockDataSet::GetData(outputVector, 0);
  auto output_vectors = vtkMultiBlockDataSet::GetData(outputVector, 1);
  auto output_coef = vtkMultiBlockDataSet::GetData(outputVector, 2);
  auto output_data = vtkMultiBlockDataSet::GetData(outputVector, 3);
 
  // ------------------------------------------
  // --- Tracking information
  // ------------------------------------------
  auto originsMatchingSize = originsMatchings_.size();
  std::vector<std::vector<ttk::ftm::idNode>> originsMatchingVectorT(
    originsMatchingSize),
    invOriginsMatchingVectorT = originsMatchingVectorT;
  for(unsigned int l = 0; l < originsMatchingVectorT.size(); ++l) {
    auto &tree1 = (l == 0 ? origins_[0] : originsPrime_[l - 1]);
    auto &tree2 = (l == 0 ? originsPrime_[0] : originsPrime_[l]);
    getMatchingVector(tree1.mTree, tree2.mTree, originsMatchings_[l],
                      originsMatchingVectorT[l]);
    getInverseMatchingVector(tree1.mTree, tree2.mTree, originsMatchings_[l],
                             invOriginsMatchingVectorT[l]);
  }
  std::vector<std::vector<ttk::ftm::idNode>> originsMatchingVector;
  std::vector<std::vector<double>> originsPersPercent, originsPersDiff;
  std::vector<double> originPersPercent, originPersDiff;
  std::vector<int> originPersistenceOrder;
  ttk::wae::computeTrackingInformation(
    origins_, originsPrime_, originsMatchingVectorT, invOriginsMatchingVectorT,
    isPersistenceDiagram_, originsMatchingVector, originsPersPercent,
    originsPersDiff, originPersPercent, originPersDiff, originPersistenceOrder);
 
  std::vector<std::vector<std::vector<ttk::ftm::idNode>>>
    invDataMatchingVectorT(dataMatchings_.size());
  for(unsigned int l = 0; l < invDataMatchingVectorT.size(); ++l) {
    invDataMatchingVectorT[l].resize(dataMatchings_[l].size());
    for(unsigned int i = 0; i < invDataMatchingVectorT[l].size(); ++i)
      getInverseMatchingVector(origins_[l].mTree, recs_[i][l].mTree,
                               dataMatchings_[l][i],
                               invDataMatchingVectorT[l][i]);
  }
  std::vector<std::vector<ttk::ftm::idNode>> invReconstMatchingVectorT(
    reconstMatchings_.size());
  for(unsigned int i = 0; i < invReconstMatchingVectorT.size(); ++i) {
    auto l = recs_[i].size() - 1;
    getInverseMatchingVector(recs_[i][0].mTree, recs_[i][l].mTree,
                             reconstMatchings_[i],
                             invReconstMatchingVectorT[i]);
  }
 
  // ------------------------------------------
  // --- Data
  // ------------------------------------------
  output_data->SetNumberOfBlocks(1);
  vtkSmartPointer<vtkMultiBlockDataSet> data
    = vtkSmartPointer<vtkMultiBlockDataSet>::New();
  data->SetNumberOfBlocks(1);
  vtkSmartPointer<vtkMultiBlockDataSet> dataSeg
    = vtkSmartPointer<vtkMultiBlockDataSet>::New();
  dataSeg->SetNumberOfBlocks(recs_.size());
  bool outputSegmentation = !treesSegmentation.empty() and treesSegmentation[0];
  for(unsigned int l = 0; l < 1; ++l) {
    vtkSmartPointer<vtkMultiBlockDataSet> out_layer_i
      = vtkSmartPointer<vtkMultiBlockDataSet>::New();
    out_layer_i->SetNumberOfBlocks(recs_.size());
    std::vector<ttk::ftm::MergeTree<float> *> trees(recs_.size());
    for(unsigned int i = 0; i < recs_.size(); ++i)
      trees[i] = &(recs_[i][l].mTree);
 
    // Custom arrays
    std::vector<std::vector<std::tuple<std::string, std::vector<int>>>>
      customIntArrays(recs_.size());
    std::vector<std::vector<std::tuple<std::string, std::vector<double>>>>
      customDoubleArrays(recs_.size());
    unsigned int lShift = 0;
    ttk::wae::computeCustomArrays(
      recs_, persCorrelationMatrix_, invDataMatchingVectorT,
      invReconstMatchingVectorT, originsMatchingVector, originsMatchingVectorT,
      originsPersPercent, originsPersDiff, originPersistenceOrder, l, lShift,
      customIntArrays, customDoubleArrays);
 
    // Create output
    ttk::wae::makeManyOutput(trees, treesNodes, treesNodeCorr_, out_layer_i,
                             customIntArrays, customDoubleArrays,
                             mixtureCoefficient_, isPersistenceDiagram_,
                             convertToDiagram_, this->debugLevel_);
    if(outputSegmentation and l == 0) {
      ttk::wae::makeManyOutput(
        trees, treesNodes, treesNodeCorr_, treesSegmentation, dataSeg,
        customIntArrays, customDoubleArrays, mixtureCoefficient_,
        isPersistenceDiagram_, convertToDiagram_, this->debugLevel_);
    }
    data->SetBlock(l, out_layer_i);
    std::stringstream ss;
    ss << (l == 0 ? "Input" : "Layer") << l;
    data->GetMetaData(l)->Set(vtkCompositeDataSet::NAME(), ss.str());
  }
  output_data->SetBlock(0, data);
  unsigned int num = 0;
  output_data->GetMetaData(num)->Set(
    vtkCompositeDataSet::NAME(), "layersTrees");
  if(outputSegmentation)
    output_data->SetBlock(1, dataSeg);
  vtkNew<vtkFloatArray> lossArray{};
  lossArray->SetName("Loss");
  lossArray->InsertNextTuple1(bestLoss_);
  output_data->GetFieldData()->AddArray(lossArray);
 
  // ------------------------------------------
  // --- Origins
  // ------------------------------------------
  output_origins->SetNumberOfBlocks(2);
  // Origins
  vtkSmartPointer<vtkMultiBlockDataSet> origins
    = vtkSmartPointer<vtkMultiBlockDataSet>::New();
  vtkSmartPointer<vtkMultiBlockDataSet> originsP
    = vtkSmartPointer<vtkMultiBlockDataSet>::New();
  origins->SetNumberOfBlocks(noLayers_);
  originsP->SetNumberOfBlocks(noLayers_);
  std::vector<ttk::ftm::MergeTree<float> *> trees(noLayers_);
  std::vector<std::vector<std::tuple<std::string, std::vector<int>>>>
    customIntArrays(noLayers_);
  std::vector<std::vector<std::tuple<std::string, std::vector<double>>>>
    customDoubleArrays(noLayers_);
  for(unsigned int l = 0; l < noLayers_; ++l) {
    trees[l] = &(origins_[l].mTree);
    if(l == 0) {
      std::string name2{"OriginPersPercent"};
      customDoubleArrays[l].emplace_back(
        std::make_tuple(name2, originPersPercent));
      std::string name3{"OriginPersDiff"};
      customDoubleArrays[l].emplace_back(
        std::make_tuple(name3, originPersDiff));
      std::string nameOrder{"OriginPersOrder"};
      customIntArrays[l].emplace_back(
        std::make_tuple(nameOrder, originPersistenceOrder));
    }
  }
  ttk::wae::makeManyOutput(trees, origins, customIntArrays, customDoubleArrays,
                           mixtureCoefficient_, isPersistenceDiagram_,
                           convertToDiagram_, this->debugLevel_);
 
  customIntArrays.clear();
  customIntArrays.resize(noLayers_);
  customDoubleArrays.clear();
  customDoubleArrays.resize(noLayers_);
  for(unsigned int l = 0; l < noLayers_; ++l) {
    trees[l] = &(originsPrime_[l].mTree);
    if(l < originsMatchingVector.size()) {
      std::vector<int> customArrayMatching,
        originPersOrder(trees[l]->tree.getNumberOfNodes(), -1);
      for(unsigned int i = 0; i < originsMatchingVector[l].size(); ++i) {
        customArrayMatching.emplace_back(originsMatchingVector[l][i]);
        if(originsMatchingVector[l][i] < originPersistenceOrder.size())
          originPersOrder[i]
            = originPersistenceOrder[originsMatchingVector[l][i]];
      }
      std::string name{"OriginTrueNodeId"};
      customIntArrays[l].emplace_back(
        std::make_tuple(name, customArrayMatching));
      std::string nameOrder{"OriginPersOrder"};
      customIntArrays[l].emplace_back(
        std::make_tuple(nameOrder, originPersOrder));
      std::string name2{"OriginPersPercent"};
      customDoubleArrays[l].emplace_back(
        std::make_tuple(name2, originsPersPercent[l]));
      std::string name3{"OriginPersDiff"};
      customDoubleArrays[l].emplace_back(
        std::make_tuple(name3, originsPersDiff[l]));
    }
  }
  ttk::wae::makeManyOutput(trees, originsP, customIntArrays, customDoubleArrays,
                           mixtureCoefficient_, isPersistenceDiagram_,
                           convertToDiagram_, this->debugLevel_);
  output_origins->SetBlock(0, origins);
  output_origins->SetBlock(1, originsP);
  // for(unsigned int l = 0; l < 2; ++l) {
  for(unsigned int l = 0; l < noLayers_; ++l) {
    if(l >= 2)
      break;
    std::stringstream ss;
    ss << (l == 0 ? "InputOrigin" : "LayerOrigin") << l;
    auto originsMetaData = origins->GetMetaData(l);
    if(originsMetaData)
      originsMetaData->Set(vtkCompositeDataSet::NAME(), ss.str());
    ss.str("");
    ss << (l == 0 ? "InputOriginPrime" : "LayerOriginPrime") << l;
    auto originsPMetaData = originsP->GetMetaData(l);
    if(originsPMetaData)
      originsPMetaData->Set(vtkCompositeDataSet::NAME(), ss.str());
  }
  num = 0;
  output_origins->GetMetaData(num)->Set(
    vtkCompositeDataSet::NAME(), "layersOrigins");
  num = 1;
  output_origins->GetMetaData(num)->Set(
    vtkCompositeDataSet::NAME(), "layersOriginsPrime");
 
  // ------------------------------------------
  // --- Coefficients
  // ------------------------------------------
  output_coef->SetNumberOfBlocks(allAlphas_[0].size());
  for(unsigned int l = 0; l < allAlphas_[0].size(); ++l) {
    vtkSmartPointer<vtkTable> coef_table = vtkSmartPointer<vtkTable>::New();
    vtkNew<vtkIntArray> treeIDArray{};
    treeIDArray->SetName("TreeID");
    treeIDArray->SetNumberOfTuples(inputTrees.size());
    for(unsigned int i = 0; i < inputTrees.size(); ++i)
      treeIDArray->SetTuple1(i, i);
    coef_table->AddColumn(treeIDArray);
    auto noVec = allAlphas_[0][l].sizes()[0];
    for(unsigned int v = 0; v < noVec; ++v) {
      // Alphas
      vtkNew<vtkFloatArray> tArray{};
      std::string name = ttk::axa::getTableCoefficientName(noVec, v);
      tArray->SetName(name.c_str());
      tArray->SetNumberOfTuples(allAlphas_.size());
      // Act Alphas
      vtkNew<vtkFloatArray> actArray{};
      std::string actName = "Act" + name;
      actArray->SetName(actName.c_str());
      actArray->SetNumberOfTuples(allAlphas_.size());
      // Scaled Alphas
      vtkNew<vtkFloatArray> tArrayNorm{};
      std::string nameNorm = ttk::axa::getTableCoefficientNormName(noVec, v);
      tArrayNorm->SetName(nameNorm.c_str());
      tArrayNorm->SetNumberOfTuples(allAlphas_.size());
      // Act Scaled Alphas
      vtkNew<vtkFloatArray> actArrayNorm{};
      std::string actNameNorm = "Act" + nameNorm;
      actArrayNorm->SetName(actNameNorm.c_str());
      actArrayNorm->SetNumberOfTuples(allAlphas_.size());
      // Fill Arrays
      for(unsigned int i = 0; i < allAlphas_.size(); ++i) {
        tArray->SetTuple1(i, allAlphas_[i][l][v].item<float>());
        actArray->SetTuple1(i, allActAlphas_[i][l][v].item<float>());
        tArrayNorm->SetTuple1(i, allScaledAlphas_[i][l][v].item<float>());
        actArrayNorm->SetTuple1(i, allActScaledAlphas_[i][l][v].item<float>());
      }
      coef_table->AddColumn(tArray);
      coef_table->AddColumn(actArray);
      coef_table->AddColumn(tArrayNorm);
      coef_table->AddColumn(actArrayNorm);
    }
    if(!clusterAsgn_.empty()) {
      vtkNew<vtkIntArray> clusterArray{};
      clusterArray->SetName("ClusterAssignment");
      clusterArray->SetNumberOfTuples(inputTrees.size());
      for(unsigned int i = 0; i < clusterAsgn_.size(); ++i)
        clusterArray->SetTuple1(i, clusterAsgn_[i]);
      coef_table->AddColumn(clusterArray);
    }
    if(l == 0) {
      vtkNew<vtkIntArray> treesNoNodesArray{};
      treesNoNodesArray->SetNumberOfTuples(recs_.size());
      treesNoNodesArray->SetName("treeNoNodes");
      for(unsigned int i = 0; i < recs_.size(); ++i)
        treesNoNodesArray->SetTuple1(
          i, recs_[i][0].mTree.tree.getNumberOfNodes());
      coef_table->AddColumn(treesNoNodesArray);
    }
    output_coef->SetBlock(l, coef_table);
    std::stringstream ss;
    ss << "Coef" << l;
    output_coef->GetMetaData(l)->Set(vtkCompositeDataSet::NAME(), ss.str());
  }
 
  // Copy Field Data
  // - aggregate input field data
  for(unsigned int b = 0; b < inputTrees[0]->GetNumberOfBlocks(); ++b) {
    vtkNew<vtkFieldData> fd{};
    fd->CopyStructure(inputTrees[0]->GetBlock(b)->GetFieldData());
    fd->SetNumberOfTuples(inputTrees.size());
    for(size_t i = 0; i < inputTrees.size(); ++i) {
      fd->SetTuple(i, 0, inputTrees[i]->GetBlock(b)->GetFieldData());
    }
 
    // - copy input field data to output row data
    for(int i = 0; i < fd->GetNumberOfArrays(); ++i) {
      auto array = fd->GetAbstractArray(i);
      array->SetName(array->GetName());
      vtkTable::SafeDownCast(output_coef->GetBlock(0))->AddColumn(array);
    }
  }
 
  // Field Data Input Parameters
  std::vector<std::string> paramNames;
  getParamNames(paramNames);
  for(auto paramName : paramNames) {
    vtkNew<vtkDoubleArray> array{};
    array->SetName(paramName.c_str());
    array->InsertNextTuple1(getParamValueFromName(paramName));
    output_coef->GetFieldData()->AddArray(array);
  }
  vtkNew<vtkDoubleArray> arrayActivate{};
  arrayActivate->SetName("activate");
  arrayActivate->InsertNextTuple1(activate_);
  output_coef->GetFieldData()->AddArray(arrayActivate);
  vtkNew<vtkDoubleArray> arrayActivateFunction{};
  arrayActivateFunction->SetName("activationFunction");
  arrayActivateFunction->InsertNextTuple1(activationFunction_);
  output_coef->GetFieldData()->AddArray(arrayActivateFunction);
 
  // ------------------------------------------
  // --- Axes Vectors
  // ------------------------------------------
  std::vector<std::vector<std::vector<ttk::ftm::idNode>>> dataMatchingVectorT(
    dataMatchings_.size());
  for(unsigned int l = 0; l < dataMatchingVectorT.size(); ++l) {
    dataMatchingVectorT[l].resize(dataMatchings_[l].size());
    for(unsigned int i = 0; i < dataMatchingVectorT[l].size(); ++i) {
      auto &origin = (l == 0 ? origins_[0] : originsPrime_[l - 1]);
      getMatchingVector(origin.mTree, recs_[i][l].mTree, dataMatchings_[l][i],
                        dataMatchingVectorT[l][i]);
    }
  }
  output_vectors->SetNumberOfBlocks(2);
  vtkSmartPointer<vtkMultiBlockDataSet> vectors
    = vtkSmartPointer<vtkMultiBlockDataSet>::New();
  vectors->SetNumberOfBlocks(vSTensor_.size());
  vtkSmartPointer<vtkMultiBlockDataSet> vectorsPrime
    = vtkSmartPointer<vtkMultiBlockDataSet>::New();
  vectorsPrime->SetNumberOfBlocks(vSTensor_.size());
  for(unsigned int l = 0; l < vSTensor_.size(); ++l) {
    vtkSmartPointer<vtkTable> vectorsTable = vtkSmartPointer<vtkTable>::New();
    vtkSmartPointer<vtkTable> vectorsPrimeTable
      = vtkSmartPointer<vtkTable>::New();
    for(unsigned int v = 0; v < vSTensor_[l].sizes()[1]; ++v) {
      // Vs
      vtkNew<vtkFloatArray> vectorArray{};
      std::string name
        = ttk::axa::getTableVectorName(vSTensor_[l].sizes()[1], v, 0, 0, false);
      vectorArray->SetName(name.c_str());
      vectorArray->SetNumberOfTuples(vSTensor_[l].sizes()[0]);
      for(unsigned int i = 0; i < vSTensor_[l].sizes()[0]; ++i)
        vectorArray->SetTuple1(i, vSTensor_[l][i][v].item<float>());
      vectorsTable->AddColumn(vectorArray);
      // Vs Prime
      vtkNew<vtkFloatArray> vectorPrimeArray{};
      std::string name2
        = ttk::axa::getTableVectorName(vSTensor_[l].sizes()[1], v, 0, 0, false);
      vectorPrimeArray->SetName(name2.c_str());
      vectorPrimeArray->SetNumberOfTuples(vSPrimeTensor_[l].sizes()[0]);
      for(unsigned int i = 0; i < vSPrimeTensor_[l].sizes()[0]; ++i)
        vectorPrimeArray->SetTuple1(i, vSPrimeTensor_[l][i][v].item<float>());
      vectorsPrimeTable->AddColumn(vectorPrimeArray);
    }
    // Rev node corr
    vtkNew<vtkUnsignedIntArray> revNodeCorrArray{};
    revNodeCorrArray->SetName("revNodeCorr");
    revNodeCorrArray->SetNumberOfTuples(vSTensor_[l].sizes()[0]);
    std::vector<unsigned int> revNodeCorr;
    getReverseTorchNodeCorr(origins_[l], revNodeCorr);
    for(unsigned int i = 0; i < vSTensor_[l].sizes()[0]; ++i)
      revNodeCorrArray->SetTuple1(i, revNodeCorr[i]);
    vectorsTable->AddColumn(revNodeCorrArray);
    // Rev node corr prime
    vtkNew<vtkUnsignedIntArray> revNodeCorrPrimeArray{};
    revNodeCorrPrimeArray->SetNumberOfTuples(vSPrimeTensor_[l].sizes()[0]);
    revNodeCorrPrimeArray->SetName("revNodeCorr");
    std::vector<unsigned int> revNodeCorrPrime;
    getReverseTorchNodeCorr(originsPrime_[l], revNodeCorrPrime);
    for(unsigned int i = 0; i < vSPrimeTensor_[l].sizes()[0]; ++i)
      revNodeCorrPrimeArray->SetTuple1(i, revNodeCorrPrime[i]);
    vectorsPrimeTable->AddColumn(revNodeCorrPrimeArray);
    // Origins Matchings
    auto addOriginMatchingArray
      = [&](vtkSmartPointer<vtkTable> &vectorsTableT,
            std::vector<ttk::ftm::idNode> &originMatchingVector) {
          vtkNew<vtkIntArray> matchingArray{};
          matchingArray->SetNumberOfTuples(originMatchingVector.size());
          matchingArray->SetName("nextOriginMatching");
          for(unsigned int i = 0; i < originMatchingVector.size(); ++i)
            matchingArray->SetTuple1(i, (int)originMatchingVector[i]);
          vectorsTableT->AddColumn(matchingArray);
        };
    if(l == 0)
      addOriginMatchingArray(vectorsTable, originsMatchingVectorT[l]);
    if(l < originsMatchingVectorT.size() - 1)
      addOriginMatchingArray(vectorsPrimeTable, originsMatchingVectorT[l + 1]);
    // Data Matchings
    auto addDataMatchingArray
      = [&](vtkSmartPointer<vtkTable> &vectorsTableT,
            std::vector<std::vector<ttk::ftm::idNode>> &dataMatchingVector) {
          for(unsigned int i = 0; i < dataMatchingVector.size(); ++i) {
            vtkNew<vtkIntArray> matchingArray{};
            matchingArray->SetNumberOfTuples(dataMatchingVector[i].size());
            std::stringstream ss;
            ss << "matching"
               << ttk::axa::getTableTreeName(dataMatchingVector.size(), i);
            matchingArray->SetName(ss.str().c_str());
            for(unsigned int j = 0; j < dataMatchingVector[i].size(); ++j)
              matchingArray->SetTuple1(j, (int)dataMatchingVector[i][j]);
            vectorsTableT->AddColumn(matchingArray);
          }
        };
    if(l == 0)
      addDataMatchingArray(vectorsTable, dataMatchingVectorT[l]);
    if(l < dataMatchingVectorT.size() - 1)
      addDataMatchingArray(vectorsPrimeTable, dataMatchingVectorT[l + 1]);
    // Reconst Matchings
    if(l == vSTensor_.size() - 1) {
      for(unsigned int i = 0; i < invReconstMatchingVectorT.size(); ++i) {
        vtkNew<vtkIntArray> matchingArray{};
        matchingArray->SetNumberOfTuples(invReconstMatchingVectorT[i].size());
        std::stringstream ss;
        ss << "reconstMatching"
           << ttk::axa::getTableTreeName(invReconstMatchingVectorT.size(), i);
        matchingArray->SetName(ss.str().c_str());
        for(unsigned int j = 0; j < invReconstMatchingVectorT[i].size(); ++j)
          matchingArray->SetTuple1(j, (int)invReconstMatchingVectorT[i][j]);
        vectorsPrimeTable->AddColumn(matchingArray);
      }
    }
 
    // Add new block
    vectors->SetBlock(l, vectorsTable);
    std::stringstream ss;
    ss << "Vectors" << l;
    vectors->GetMetaData(l)->Set(vtkCompositeDataSet::NAME(), ss.str());
    vectorsPrime->SetBlock(l, vectorsPrimeTable);
    ss.str("");
    ss << "VectorsPrime" << l;
    vectorsPrime->GetMetaData(l)->Set(vtkCompositeDataSet::NAME(), ss.str());
  }
  output_vectors->SetBlock(0, vectors);
  output_vectors->SetBlock(1, vectorsPrime);
  num = 0;
  output_vectors->GetMetaData(num)->Set(vtkCompositeDataSet::NAME(), "Vectors");
  num = 1;
  output_vectors->GetMetaData(num)->Set(
    vtkCompositeDataSet::NAME(), "VectorsPrime");
 
  // return success
  return 1;
}
#endif