tpl_indexGraph.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 TPL_INDEXGRAPH
# define TPL_INDEXGRAPH
 
# include <tpl_indexNode.H>
# include <tpl_indexArc.H>
 
# include <ah-errors.H>
 
namespace Aleph
{
 
template <class GT, class Compare = Dft_Node_Cmp<GT>,
          template <class /* Key */, class /* Compare */> class Tree = Treap>
class Index_Graph
{
private:
 
  typedef typename GT::Arc GT_Arc;
  typedef typename GT::Node GT_Node;
  typedef typename GT::Arc_Type GT_Arc_Type;
  typedef typename GT::Node_Type GT_Node_Type;
 
  IndexNode<GT, Compare, Tree> idx_node;
  IndexArc<GT, Tree>           idx_arc;
 
public:
 
  Index_Graph(GT & g) : idx_node(g), idx_arc(g)
  {
    // empty
  }
 
  GT_Node * insert_node(const GT_Node_Type & info)
  {
    return idx_node.insert_in_graph(info);
  }
 
  GT_Arc * insert_arc(GT_Node * src, GT_Node * tgt,
                      const GT_Arc_Type & info = GT_Arc_Type())
  {
    ah_domain_error_if(idx_node.search(src) == nullptr)
        << "src node not in index";
 
    ah_domain_error_if(idx_node.search(tgt) == nullptr)
        << "tgt node not in index";
 
    return idx_arc.insert_in_graph(src, tgt, info);
  }
 
  GT_Node * search_node(GT_Node * p)
  {
    return idx_node.search(p);
  }
 
  GT_Node * search_node(const GT_Node_Type & info)
  {
    return idx_node.search(info);
  }
 
  GT_Arc * search_arc(GT_Node * src, GT_Node * tgt)
  {
    return idx_arc.search(src, tgt);
  }
 
  void remove_node(GT_Node * p)
  {
    // eliminar del índice los arcos emanantes del nodo (ellos serán
    // eliminados por la eliminación de nodo del grafo)
    for (typename GT::Node_Arc_Iterator it(p); it.has_curr(); it.next_ne())
      idx_arc.remove(it.get_curr());
 
    return idx_node.remove_from_graph(p);
  }
 
  void remove_arc(GT_Arc * a)
  {
    return idx_arc.remove_from_graph(a);
  }
 
  size_t get_num_arcs() const { return idx_arc.size(); }
 
  size_t get_num_nodes() const { return idx_node.size(); }
};
 
  template <class GT> inline
  bool are_equal(const GT & g1, const GT & g2)
  {
    if (g1.vsize() != g2.vsize() or g1.esize() != g2.esize())
      return false;
 
    {
      IndexNode<GT> t2(const_cast<GT&>(g2));
      if (not g1.all_nodes([&t2] (auto p)
                           {
                             auto q = t2.search(p);
                             if (q == nullptr)
                               return false;
                             GT::map_nodes(p, q);
                             return true;
                           }))
        return false;
    }
 
    IndexArc<GT> t2(const_cast<GT&>(g2));
    return g1.all_arcs([idx = &t2, &g1] (auto a)
                       {
                         auto s1 = g1.get_src_node(a);
                         auto t1 = g1.get_tgt_node(a);
                         auto s2 = mapped_node<GT>(s1);
                         auto t2 = mapped_node<GT>(t1);
                         auto a2 = idx->search(s2, t2);
                         if (a2 == nullptr)
                           return false;
                         return a2->get_info() == a->get_info();
                       });
  }
 
}
 
# endif // TPL_INDEXGRAPH