writeHeap.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 <cstdlib>
# include <iostream>
# include <fstream>
# include <ctime>
# include <tclap/CmdLine.h>
# include <tpl_arrayHeap.H>
 
# include <cassert>
using namespace std;
# include <cassert>
using namespace Aleph;
 
// Local macros for heap navigation (1-indexed array)
# define HEAP_LLINK(i) (2*(i))
# define HEAP_RLINK(i) (2*(i) + 1)
 
// Output streams
ofstream output;
ofstream output_tex;
 
void preorder(int v[], int n, int i)
{
  if (i > n)
    return;
 
  output << " " << v[i];
  cout << " " << v[i];
 
  assert(v[i] > 0);
 
  preorder(v, n, HEAP_LLINK(i));
  preorder(v, n, HEAP_RLINK(i));
}
 
void inorder(int v[], int n, int i)
{
  if (i > n)
    return;
 
  assert(v[i] > 0);
 
  inorder(v, n, HEAP_LLINK(i));
  output << " " << v[i];
  cout << " " << v[i];
  inorder(v, n, HEAP_RLINK(i));
}
 
void level_order(int v[], int n)
{
  for (int i = 1; i <= n; ++i)
    {
      assert(v[i] > 0);
      output_tex << v[i] << " ";
    }
}
 
bool exists_in_heap(ArrayHeap<int>& heap, int x)
{
  for (int i = 1; i <= heap.size(); ++i)
    if (heap[i] == x)
      return true;
  return false;
}
 
int main(int argc, char* argv[])
{
  try
    {
      TCLAP::CmdLine cmd(
        "Demonstrate array-based heap structure.\n"
        "Creates a heap and generates visualization files.",
        ' ', "1.0");
 
      TCLAP::ValueArg<unsigned int> nArg("n", "count",
                                          "Number of elements",
                                          false, 10, "unsigned 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);
 
      unsigned int n = nArg.getValue();
      unsigned int t = seedArg.getValue();
 
      if (t == 0)
        t = time(nullptr);
 
      srand(t);
 
      cout << "=== Array-Based Heap Demo ===" << endl;
      cout << "Elements: " << n << ", Seed: " << t << endl << endl;
 
      // Open output files
      output.open("heap-ejm-aux.Tree", ios::out);
      output_tex.open("heap-ejm-aux.tex", ios::out);
 
      if (!output.is_open() || !output_tex.is_open())
        {
          cerr << "Error: cannot open output files" << endl;
          return 1;
        }
 
      // Build heap with unique positive values
      ArrayHeap<int> heap;
 
      cout << "Inserting values: ";
      for (unsigned int i = 0; i < n; i++)
        {
          int value;
          do
            {
              value = 1 + static_cast<int>(10.0 * n * rand() / (RAND_MAX + 10.0 * n));
              assert(value > 0);
            }
          while (exists_in_heap(heap, value));
 
          heap.insert(value);
          cout << value << " ";
        }
      cout << endl << endl;
 
      cout << "Heap size: " << heap.size() << endl;
      cout << "Min element (root): " << heap.top() << endl << endl;
 
      // Write preorder traversal
      output << "Prefix ";
      cout << "Preorder: ";
      preorder(&heap[0], heap.size(), 1);
      cout << endl;
 
      // Write inorder traversal
      output << endl << "Infix ";
      cout << "Inorder:  ";
      inorder(&heap[0], heap.size(), 1);
      output << endl;
      cout << endl;
 
      // Write level-order for LaTeX
      cout << "Level-order: ";
      for (int i = 1; i <= heap.size(); ++i)
        cout << heap[i] << " ";
      cout << endl;
      level_order(&heap[0], heap.size());
      output_tex << endl;
 
      // Close files
      output.close();
      output_tex.close();
 
      cout << endl << "Generated files:" << endl;
      cout << "  - heap-ejm-aux.Tree (preorder + inorder for btreepic)" << endl;
      cout << "  - heap-ejm-aux.tex (level-order for LaTeX)" << endl;
    }
  catch (TCLAP::ArgException& e)
    {
      cerr << "Error: " << e.error() << " for arg " << e.argId() << endl;
      return 1;
    }
 
  return 0;
}