grid.H

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.
*/
 
 
# ifndef GRID_H
# define GRID_H
 
namespace Aleph 
{ 
 
template <class GT>
struct Default_Operation_On_Node
{
  void operator () (GT & g, typename GT::Node * n, const size_t & row, const size_t & col) { (void)g; (void)n; (void)row; (void)col; }
};
 
template <class GT>
struct Default_Operation_On_Arc
{
  void operator () (GT & g, typename GT::Arc * a, const size_t & row, const size_t & col) { (void)g; (void)a; (void)row; (void)col; }
};
 
template <
          class GT,
          class Operation_On_Node = Default_Operation_On_Node<GT>,
          class Operation_On_Arc = Default_Operation_On_Arc<GT>
         >
class Build_Grid
{
public:
 
  void operator () (GT & g, const size_t & width, const size_t & height)
  {
    ah_domain_error_if(g.get_num_nodes() != 0)
        << "There is nodes in graph";
 
    ah_length_error_if(width < 2 or height < 2)
        << "The minimun size must be 2 x 2";
 
    typename GT::Node *** map = new typename GT::Node **[height];
    for (size_t i = 0; i < height; ++i)
      {
  try
    {
      map[i] = new typename GT::Node *[width];
      for (size_t j = 0; j < width; ++j)
        {
    typename GT::Node * n = g.insert_node(typename GT::Node_Type());
    Operation_On_Node()(g, n, i, j);
    map[i][j] = n;
    if (j > 0) // Connect to left neighbor
      {
        typename GT::Arc * a = g.insert_arc(n, map[i][j - 1]);
        Operation_On_Arc()(g, a, i, j);
      }
    if (i > 0) // Connect to upper neighbor
      {
        typename GT::Arc * a = g.insert_arc(n, map[i - 1][j]);
        Operation_On_Arc()(g, a, i, j);
      }
    if (i > 0 and j > 0) // Connect to upper-left diagonal
      {
        typename GT::Arc * a = g.insert_arc(n, map[i - 1][j - 1]);
        Operation_On_Arc()(g, a, i, j);
      }
    if (j + 1 < width and i > 0) // Connect to upper-right diagonal
      {
        typename GT::Arc * a = g.insert_arc(n, map[i - 1][j + 1]);
        Operation_On_Arc()(g, a, i, j);
      }
        }
    }
  catch (...)
    {
      for (size_t k = i; k-- > 0; )
        delete [] map[k];
      delete [] map;
      clear_graph(g);
      throw;
    }
      }
 
    for (size_t i = 0; i < height; ++i)
      delete [] map[i];
    delete [] map;
  }
};
 
}
 
# endif