deway.C

Go to the documentation of this file.

 
/*
                          Aleph_w
 
  Data structures & Algorithms
  version 2.0.0b
  https://github.com/lrleon/Aleph-w
 
  This file is part of Aleph-w library
 
  Copyright (c) 2002-2026 Leandro Rabindranath Leon
 
  Permission is hereby granted, free of charge, to any person obtaining a copy
  of this software and associated documentation files (the "Software"), to deal
  in the Software without restriction, including without limitation the rights
  to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
  copies of the Software, and to permit persons to whom the Software is
  furnished to do so, subject to the following conditions:
 
  The above copyright notice and this permission notice shall be included in all
  copies or substantial portions of the Software.
 
  THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
  IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
  FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
  AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
  LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
  OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
  SOFTWARE.
*/
 
 
# include <iostream>
# include <tclap/CmdLine.h>
# include <tpl_binNodeUtils.H>
# include <tpl_tree_node.H>
# include <generate_tree.H>
# include <ah-errors.H>
 
# include <cstdlib>
# include <cassert>
using namespace std;
# include <cstdlib>
# include <cassert>
using namespace Aleph;
 
void deway(Tree_Node<int> * p, int prefix[], const int & len, 
           const size_t & dim)
{
  int i = 1;
 
  if (len == 0)
    cout << "Root ";
  else
    cout << "Node " << prefix[i++];
  
  while (i <= len)
    cout << "." << prefix[i++];
 
  cout << " \"" << p->get_key() << "\"" << endl;
  
  if (static_cast<size_t>(len) >= dim)
    ah_overflow_error_if(true) << "Array dimension is smaller than Deway chain";
  
  Tree_Node<int> * child = p->get_left_child(); 
  
  for (int j = 0; child != nullptr; ++j, child = child->get_right_sibling())
    {
      prefix[len + 1] = j;
      deway(child, prefix, len + 1, dim);
    }
}
 
void deway(Tree_Node<int> * p, const int & h)
{
  const size_t dim = 10 * h;
 
  int * prefix = new int [dim];
 
  for (int i = 0; p != nullptr; ++i, p = p->get_right_sibling())
    {
      prefix[0] = i;
      deway(p, prefix, 0, dim);
    }
 
  delete [] prefix;
}
 
template <class Node>
static void printNode(Node * node, int, int)
{ 
  cout << " " << node->get_key();
}
 
int random_int(int l, int r)
{
  assert(l <= r);
  const int n = r - l;
  const int rd = 1 + static_cast<int>(1.0 * n * rand() / (RAND_MAX + 1.0));
  return l + rd - 1;
}
 
BinNode<int> * random_tree(int l, int r)
{
  if (l > r)
    return nullptr;
 
  auto * root = new BinNode<int>(random_int(l, r));
 
  LLINK(root) = random_tree(l, KEY(root) - 1);
  RLINK(root) = random_tree(KEY(root) + 1, r);
 
  return root;
}
 
int main(int argc, char * argv[])
{
  try
    {
      TCLAP::CmdLine cmd("Deway numbering example for trees", ' ', "1.0");
 
      TCLAP::ValueArg<int> nArg("n", "nodes", 
                                 "Number of nodes in the tree",
                                 false, 10, "int");
      cmd.add(nArg);
 
      TCLAP::ValueArg<unsigned int> seedArg("s", "seed",
                                             "Random seed (0 = use time)",
                                             false, 0, "unsigned int");
      cmd.add(seedArg);
 
      cmd.parse(argc, argv);
 
      int n = nArg.getValue();
      unsigned int t = seedArg.getValue();
 
      if (t == 0)
        t = time(nullptr);
 
      srand(t);
 
      cout << "Deway Numbering Example" << endl;
      cout << "=======================" << endl;
      cout << "Parameters: n=" << n << ", seed=" << t << endl << endl;
 
      // Generate random binary tree
      BinNode<int> * bp = random_tree(1, n);
 
      cout << "Binary tree (preorder):";
      preOrderRec(bp, printNode);
      cout << endl << endl;
      
      cout << "Binary tree (inorder):";
      inOrderRec(bp, printNode);
      cout << endl << endl;
      
      // Convert to forest
      Tree_Node<int> * tree = bin_to_forest<Tree_Node<int>, BinNode<int>>(bp);
 
      // bin_to_forest creates a forest where sibling trees are linked,
      // but the is_root flag is not set correctly for siblings.
      // We fix this by setting is_root=true for all sibling trees.
      for (auto* t = tree; t != nullptr; t = t->get_right_sibling())
        t->set_is_root(true);
 
      cout << "Forest (preorder):";
      forest_preorder_traversal(tree, printNode);
      cout << endl << endl;
 
      cout << "Forest (postorder):";
      forest_postorder_traversal(tree, printNode);
      cout << endl << endl;
 
      // Verify conversion is reversible
      BinNode<int> * prb = forest_to_bin<Tree_Node<int>, BinNode<int>>(tree);
      assert(areEquivalents(prb, bp));
      cout << "Conversion verification: PASSED" << endl << endl;
 
      // Print Deway numbering
      cout << "Deway Numbering:" << endl;
      cout << "----------------" << endl;
      deway(tree, computeHeightRec(bp));
 
      // Cleanup
      destroyRec(bp);
      destroyRec(prb);
      destroy_forest(tree);
 
      cout << endl << "Done." << endl;
    }
  catch (TCLAP::ArgException &e)
    {
      cerr << "Error: " << e.error() << " for arg " << e.argId() << endl;
      return 1;
    }
 
  return 0;
}