aleph-graph.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 ALEPH_GRAPH_H
# define ALEPH_GRAPH_H
 
# include <cassert>
# include <cstring>
# include <stdexcept>
# include <memory>
# include <string>
 
namespace Aleph {
 
 
static const long No_Visited = 0; // nodo o arco no ha sido visitado
 
enum Graph_Bits
{
  Depth_First,
  Breadth_First,
  Test_Cycle,
  Find_Path,
  Euler,
  Maximum_Flow,
  Spanning_Tree,
  Build_Subtree,
  Convert_Tree,
  Cut,
  Min,
 
  Num_Bits_Graph
};
 
 
  extern const unsigned char Processed; 
 
  extern const unsigned char Processing;
 
  extern const unsigned char Unprocessed;
 
 
class Bit_Fields
{
public:
 
  unsigned int depth_first    : 1; 
  unsigned int breadth_first  : 1; 
  unsigned int test_cycle     : 1; 
  unsigned int find_path      : 1; 
  unsigned int euler          : 1; 
  unsigned int maximum_flow   : 1; 
  unsigned int spanning_tree  : 1; 
  unsigned int build_subtree  : 1; 
  unsigned int convert_tree   : 1; 
  unsigned int cut            : 1; 
  unsigned int min            : 1; 
 
  unsigned int state          : 2; 
 
  Bit_Fields() noexcept
  {
    reset();
  }
 
  [[nodiscard]] bool get_bit(int bit) const noexcept
  {
    switch (bit)
      {
      case Aleph::Depth_First:   return depth_first;
      case Aleph::Breadth_First: return breadth_first;
      case Aleph::Test_Cycle:    return test_cycle;
      case Aleph::Find_Path:     return find_path;
      case Aleph::Euler:         return euler;
      case Aleph::Maximum_Flow:  return maximum_flow;
      case Aleph::Spanning_Tree: return spanning_tree;
      case Aleph::Build_Subtree: return build_subtree;
      case Aleph::Convert_Tree:  return convert_tree;
      case Aleph::Cut:           return cut;
      case Aleph::Min:           return min;
      default: assert(false);
      }
    return false;
  }
 
  void set_bit(int bit, int value) noexcept
  {
    assert(value == 0 or value == 1);
    switch (bit)
      {
      case Aleph::Depth_First:   depth_first   = value; break;
      case Aleph::Breadth_First: breadth_first = value; break;
      case Aleph::Test_Cycle:    test_cycle    = value; break;
      case Aleph::Find_Path:     find_path     = value; break;
      case Aleph::Euler:         euler         = value; break;
      case Aleph::Maximum_Flow:  maximum_flow  = value; break;
      case Aleph::Spanning_Tree: spanning_tree = value; break;
      case Aleph::Build_Subtree: build_subtree = value; break;
      case Aleph::Convert_Tree:  convert_tree  = value; break;
      case Aleph::Cut:           cut           = value; break;
      case Aleph::Min:           min           = value; break;
      default: assert(false);
      }
  }
 
  [[nodiscard]] unsigned int get_state() const noexcept { return state; }
 
  [[nodiscard]] std::string str_state() const
  {
    switch (state)
      {
      case 0: return {"Unprocessed"};
      case 1: return {"Processing"};
      case 2: return {"Processed"};
      default: break;
      }
    return {"Undefined"};
  }
 
  void set_state(unsigned char s) noexcept
  {
    assert(s < 4);
    state = s;
  }
 
  void reset(int bit) noexcept { set_bit(bit, 0); }
 
  void reset() noexcept
  {
    depth_first = 0;
    breadth_first = 0;
    test_cycle = 0;
    find_path = 0;
    euler = 0;
    maximum_flow = 0;
    spanning_tree = 0;
    build_subtree = 0;
    convert_tree = 0;
    cut = 0;
    min = 0;
    state = 0;
  }
};
 
 
struct Graph_Attr
{
  Bit_Fields control_bits; 
  long       counter = 0;
  void *     cookie = nullptr; 
  
  void reset()
  {
    control_bits.reset();
    counter = 0;
    cookie = nullptr;
  }  
};
 
 
# define NODE_BITS(p)            ((p)->attrs.control_bits)
 
# define NODE_COUNTER(p)         ((p)->attrs.counter)
 
# define NODE_COLOR(p)         ((p)->attrs.counter)
 
# define IS_NODE_VISITED(p, bit) (NODE_BITS(p).get_bit(bit))
 
# define NODE_COOKIE(p)          ((p)->attrs.cookie) 
 
# define ARC_COUNTER(p)          ((p)->attrs.counter)
 
# define ARC_COLOR(p)          ((p)->attrs.counter)
 
# define ARC_BITS(p)             ((p)->attrs.control_bits)
 
# define IS_ARC_VISITED(p, bit)  (ARC_BITS(p).get_bit(bit))
 
# define ARC_COOKIE(p)           ((p)->attrs.cookie) 
 
 
 
} // end namespace Aleph
 
 
 
 
 
# endif