tpl_indexArc_test.cc

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 <gtest/gtest.h>
 
#include <stdexcept>
 
#include <tpl_graph.H>
#include <tpl_indexArc.H>
 
using namespace Aleph;
 
namespace
{
  using UGraph = List_Graph<Graph_Node<int>, Graph_Arc<int>>;
  using DGraph = List_Digraph<Graph_Node<int>, Graph_Arc<int>>;
 
  struct EvenArcInfo
  {
    bool operator()(UGraph::Arc* a) const noexcept
    {
      return (a->get_info() % 2) == 0;
    }
 
    bool operator()(const UGraph&, UGraph::Arc* a) const noexcept
    {
      return (*this)(a);
    }
  };
}
 
TEST(IndexArcUndirected, SearchIsSymmetric)
{
  UGraph g;
  auto n1 = g.insert_node(1);
  auto n2 = g.insert_node(2);
  auto a = g.insert_arc(n1, n2, 10);
 
  IndexArc<UGraph> idx(g, true);
 
  EXPECT_EQ(idx.size(), 1u);
  EXPECT_EQ(idx.search(n1, n2), a);
  EXPECT_EQ(idx.search(n2, n1), a);
  EXPECT_EQ(idx.search_directed(n1, n2), a);
  EXPECT_EQ(idx.search_directed(n2, n1), a);
}
 
TEST(IndexArcDirected, SearchRespectsDirection)
{
  DGraph g;
  auto n1 = g.insert_node(1);
  auto n2 = g.insert_node(2);
  auto a12 = g.insert_arc(n1, n2, 10);
 
  IndexArc<DGraph> idx(g, true);
 
  EXPECT_EQ(idx.size(), 1u);
  EXPECT_EQ(idx.search(n1, n2), a12);
  EXPECT_EQ(idx.search(n2, n1), nullptr);
 
  auto a21 = g.insert_arc(n2, n1, 20);
  idx.insert(a21);
  EXPECT_EQ(idx.size(), 2u);
  EXPECT_EQ(idx.search(n2, n1), a21);
}
 
TEST(IndexArc, InsertDoesNotDuplicateSamePointer)
{
  UGraph g;
  auto n1 = g.insert_node(1);
  auto n2 = g.insert_node(2);
  auto a = g.insert_arc(n1, n2, 1);
 
  IndexArc<UGraph> idx(g, false);
  EXPECT_EQ(idx.size(), 0u);
 
  EXPECT_EQ(idx.insert(a), a);
  EXPECT_EQ(idx.size(), 1u);
 
  EXPECT_EQ(idx.insert(a), a);
  EXPECT_EQ(idx.size(), 1u);
}
 
TEST(IndexArc, InsertDuplicateEndpointsReturnsExisting)
{
  UGraph g;
  auto n1 = g.insert_node(1);
  auto n2 = g.insert_node(2);
 
  IndexArc<UGraph> idx(g, false);
 
  // Insert a dummy arc that is not part of the graph, but has the same endpoints.
  auto* dummy = new UGraph::Arc(0);
  dummy->src_node = n1;
  dummy->tgt_node = n2;
  EXPECT_EQ(idx.insert(dummy), dummy);
  EXPECT_EQ(idx.size(), 1u);
 
  auto a = g.insert_arc(n1, n2, 123);
  EXPECT_EQ(idx.insert(a), dummy);
  EXPECT_EQ(idx.size(), 1u);
 
  idx.remove(dummy);
  delete dummy;
}
 
TEST(IndexArc, InsertInGraphAndRemoveFromGraph)
{
  UGraph g;
  auto n1 = g.insert_node(1);
  auto n2 = g.insert_node(2);
 
  IndexArc<UGraph> idx(g, true);
  EXPECT_EQ(idx.size(), 0u);
 
  auto a = idx.insert_in_graph(n1, n2, 7);
  EXPECT_EQ(g.get_num_arcs(), 1u);
  EXPECT_EQ(idx.size(), 1u);
  EXPECT_EQ(idx.search(n1, n2), a);
 
  EXPECT_THROW(idx.insert_in_graph(n1, n2, 8), std::domain_error);
 
  idx.remove_from_graph(a);
  EXPECT_EQ(g.get_num_arcs(), 0u);
  EXPECT_EQ(idx.size(), 0u);
  EXPECT_EQ(idx.search(n1, n2), nullptr);
}
 
TEST(IndexArc, ClearIndexAndRebuild)
{
  UGraph g;
  auto n1 = g.insert_node(1);
  auto n2 = g.insert_node(2);
  auto n3 = g.insert_node(3);
 
  auto a12 = g.insert_arc(n1, n2, 1);
  auto a23 = g.insert_arc(n2, n3, 2);
  (void)a12;
  (void)a23;
 
  IndexArc<UGraph> idx(g, true);
  EXPECT_EQ(idx.size(), g.get_num_arcs());
 
  idx.clear_index();
  EXPECT_EQ(idx.size(), 0u);
 
  idx.build_index();
  EXPECT_EQ(idx.size(), g.get_num_arcs());
}
 
TEST(IndexArc, ConstructorWithFilterOnlyIndexesMatchingArcs)
{
  UGraph g;
  auto n1 = g.insert_node(1);
  auto n2 = g.insert_node(2);
  auto n3 = g.insert_node(3);
 
  auto a12 = g.insert_arc(n1, n2, 1); // odd
  auto a23 = g.insert_arc(n2, n3, 2); // even
 
  IndexArc<UGraph, Rand_Tree, EvenArcInfo> idx(g, true, EvenArcInfo{});
 
  EXPECT_EQ(idx.size(), 1u);
  EXPECT_EQ(idx.search(n2, n3), a23);
  EXPECT_EQ(idx.search(n1, n2), nullptr);
 
  // But the arc is in the graph.
  EXPECT_EQ(Aleph::search_arc(g, n1, n2), a12);
}