io_graph_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 <sstream>
#include <cstdio>
#include <algorithm>
#include <io_graph.H>
#include <tpl_graph.H>
 
using namespace Aleph;
 
//============================================================================
// Test Fixtures
//============================================================================
 
class IOGraphTest : public ::testing::Test
{
protected:
  using Graph = List_Graph<Graph_Node<int>, Graph_Arc<double>>;
  using Node = Graph::Node;
  using Arc = Graph::Arc;
  
  void SetUp() override
  {
    // Create a simple graph:
    // 0 --1.5--> 1 --2.5--> 2
    //            |
    //           3.5
    //            v
    //            3
    
    n0 = g.insert_node(100);
    n1 = g.insert_node(200);
    n2 = g.insert_node(300);
    n3 = g.insert_node(400);
    
    g.insert_arc(n0, n1, 1.5);
    g.insert_arc(n1, n2, 2.5);
    g.insert_arc(n1, n3, 3.5);
    
    // Generate unique filename
    binary_file = "/tmp/aleph_io_graph_test_" + std::to_string(rand()) + ".bin";
    text_file = "/tmp/aleph_io_graph_test_" + std::to_string(rand()) + ".txt";
  }
  
  void TearDown() override
  {
    std::remove(binary_file.c_str());
    std::remove(text_file.c_str());
  }
  
  // Helper to collect node values
  std::vector<int> get_node_values(Graph & graph)
  {
    std::vector<int> values;
    for (typename Graph::Node_Iterator it(graph); it.has_curr(); it.next())
      values.push_back(it.get_curr()->get_info());
    std::sort(values.begin(), values.end());
    return values;
  }
  
  // Helper to collect arc values
  std::vector<double> get_arc_values(Graph & graph)
  {
    std::vector<double> values;
    for (typename Graph::Arc_Iterator it(graph); it.has_curr(); it.next())
      values.push_back(it.get_curr()->get_info());
    std::sort(values.begin(), values.end());
    return values;
  }
  
  Graph g;
  Node *n0, *n1, *n2, *n3;
  std::string binary_file;
  std::string text_file;
};
 
//============================================================================
// Constructor Tests
//============================================================================
 
TEST_F(IOGraphTest, ConstructFromReference)
{
  IO_Graph<Graph> io(g);
  EXPECT_FALSE(io.is_verbose());
}
 
TEST_F(IOGraphTest, ConstructFromPointer)
{
  IO_Graph<Graph> io(&g);
  EXPECT_FALSE(io.is_verbose());
}
 
TEST_F(IOGraphTest, VerboseMode)
{
  IO_Graph<Graph> io(g);
  
  EXPECT_FALSE(io.is_verbose());
  
  io.set_verbose(true);
  EXPECT_TRUE(io.is_verbose());
  
  io.set_verbose(false);
  EXPECT_FALSE(io.is_verbose());
}
 
//============================================================================
// Binary Mode Tests
//============================================================================
 
TEST_F(IOGraphTest, SaveAndLoadBinary)
{
  IO_Graph<Graph> io(g);
  
  // Save
  {
    std::ofstream out(binary_file, std::ios::binary);
    ASSERT_TRUE(out.is_open());
    io.save(out);
  }
  
  // Load into new graph
  Graph g2;
  IO_Graph<Graph> io2(g2);
  
  {
    std::ifstream in(binary_file, std::ios::binary);
    ASSERT_TRUE(in.is_open());
    io2.load(in);
  }
  
  // Verify
  EXPECT_EQ(g2.get_num_nodes(), 4u);
  EXPECT_EQ(g2.get_num_arcs(), 3u);
}
 
TEST_F(IOGraphTest, BinaryPreservesNodeData)
{
  IO_Graph<Graph> io(g);
  
  // Save
  {
    std::ofstream out(binary_file, std::ios::binary);
    io.save(out);
  }
  
  // Load
  Graph g2;
  IO_Graph<Graph> io2(g2);
  
  {
    std::ifstream in(binary_file, std::ios::binary);
    io2.load(in);
  }
  
  EXPECT_EQ(get_node_values(g), get_node_values(g2));
}
 
TEST_F(IOGraphTest, BinaryPreservesArcData)
{
  IO_Graph<Graph> io(g);
  
  // Save
  {
    std::ofstream out(binary_file, std::ios::binary);
    io.save(out);
  }
  
  // Load
  Graph g2;
  IO_Graph<Graph> io2(g2);
  
  {
    std::ifstream in(binary_file, std::ios::binary);
    io2.load(in);
  }
  
  EXPECT_EQ(get_arc_values(g), get_arc_values(g2));
}
 
//============================================================================
// Text Mode Tests
//============================================================================
 
TEST_F(IOGraphTest, SaveAndLoadText)
{
  IO_Graph<Graph> io(g);
  
  // Save
  {
    std::ofstream out(text_file);
    ASSERT_TRUE(out.is_open());
    io.save_in_text_mode(out);
  }
  
  // Load into new graph
  Graph g2;
  IO_Graph<Graph> io2(g2);
  
  {
    std::ifstream in(text_file);
    ASSERT_TRUE(in.is_open());
    io2.load_in_text_mode(in);
  }
  
  // Verify
  EXPECT_EQ(g2.get_num_nodes(), 4u);
  EXPECT_EQ(g2.get_num_arcs(), 3u);
}
 
TEST_F(IOGraphTest, TextPreservesNodeData)
{
  IO_Graph<Graph> io(g);
  
  // Save
  {
    std::ofstream out(text_file);
    io.save_in_text_mode(out);
  }
  
  // Load
  Graph g2;
  IO_Graph<Graph> io2(g2);
  
  {
    std::ifstream in(text_file);
    io2.load_in_text_mode(in);
  }
  
  EXPECT_EQ(get_node_values(g), get_node_values(g2));
}
 
TEST_F(IOGraphTest, TextModeToStringStream)
{
  IO_Graph<Graph> io(g);
  
  std::ostringstream out;
  io.save_in_text_mode(out);
  
  std::string content = out.str();
  
  // Should start with node count and arc count
  EXPECT_TRUE(content.find("4") != std::string::npos);  // 4 nodes
  EXPECT_TRUE(content.find("3") != std::string::npos);  // 3 arcs
}
 
//============================================================================
// Empty Graph Tests
//============================================================================
 
TEST_F(IOGraphTest, SaveAndLoadEmptyGraphBinary)
{
  Graph empty_g;
  IO_Graph<Graph> io(empty_g);
  
  // Save
  {
    std::ofstream out(binary_file, std::ios::binary);
    io.save(out);
  }
  
  // Load
  Graph g2;
  IO_Graph<Graph> io2(g2);
  
  {
    std::ifstream in(binary_file, std::ios::binary);
    io2.load(in);
  }
  
  EXPECT_EQ(g2.get_num_nodes(), 0u);
  EXPECT_EQ(g2.get_num_arcs(), 0u);
}
 
TEST_F(IOGraphTest, SaveAndLoadEmptyGraphText)
{
  Graph empty_g;
  IO_Graph<Graph> io(empty_g);
  
  // Save
  {
    std::ofstream out(text_file);
    io.save_in_text_mode(out);
  }
  
  // Load
  Graph g2;
  IO_Graph<Graph> io2(g2);
  
  {
    std::ifstream in(text_file);
    io2.load_in_text_mode(in);
  }
  
  EXPECT_EQ(g2.get_num_nodes(), 0u);
  EXPECT_EQ(g2.get_num_arcs(), 0u);
}
 
//============================================================================
// Single Node Graph Tests
//============================================================================
 
TEST_F(IOGraphTest, SaveAndLoadSingleNodeBinary)
{
  Graph single_g;
  single_g.insert_node(42);
  
  IO_Graph<Graph> io(single_g);
  
  // Save
  {
    std::ofstream out(binary_file, std::ios::binary);
    io.save(out);
  }
  
  // Load
  Graph g2;
  IO_Graph<Graph> io2(g2);
  
  {
    std::ifstream in(binary_file, std::ios::binary);
    io2.load(in);
  }
  
  EXPECT_EQ(g2.get_num_nodes(), 1u);
  EXPECT_EQ(g2.get_num_arcs(), 0u);
  
  typename Graph::Node_Iterator it(g2);
  EXPECT_EQ(it.get_curr()->get_info(), 42);
}
 
//============================================================================
// Digraph Tests
//============================================================================
 
class IODigraphTest : public ::testing::Test
{
protected:
  using Digraph = List_Digraph<Graph_Node<int>, Graph_Arc<int>>;
  using Node = Digraph::Node;
  using Arc = Digraph::Arc;
  
  void SetUp() override
  {
    n0 = dg.insert_node(10);
    n1 = dg.insert_node(20);
    n2 = dg.insert_node(30);
    
    dg.insert_arc(n0, n1, 1);
    dg.insert_arc(n1, n2, 2);
    dg.insert_arc(n2, n0, 3);  // Cycle
    
    binary_file = "/tmp/aleph_io_digraph_test_" + std::to_string(rand()) + ".bin";
    text_file = "/tmp/aleph_io_digraph_test_" + std::to_string(rand()) + ".txt";
  }
  
  void TearDown() override
  {
    std::remove(binary_file.c_str());
    std::remove(text_file.c_str());
  }
  
  Digraph dg;
  Node *n0, *n1, *n2;
  std::string binary_file;
  std::string text_file;
};
 
TEST_F(IODigraphTest, SaveAndLoadBinary)
{
  IO_Graph<Digraph> io(dg);
  
  // Save
  {
    std::ofstream out(binary_file, std::ios::binary);
    io.save(out);
  }
  
  // Load
  Digraph dg2;
  IO_Graph<Digraph> io2(dg2);
  
  {
    std::ifstream in(binary_file, std::ios::binary);
    io2.load(in);
  }
  
  EXPECT_EQ(dg2.get_num_nodes(), 3u);
  EXPECT_EQ(dg2.get_num_arcs(), 3u);
}
 
TEST_F(IODigraphTest, SaveAndLoadText)
{
  IO_Graph<Digraph> io(dg);
  
  // Save
  {
    std::ofstream out(text_file);
    io.save_in_text_mode(out);
  }
  
  // Load
  Digraph dg2;
  IO_Graph<Digraph> io2(dg2);
  
  {
    std::ifstream in(text_file);
    io2.load_in_text_mode(in);
  }
  
  EXPECT_EQ(dg2.get_num_nodes(), 3u);
  EXPECT_EQ(dg2.get_num_arcs(), 3u);
}
 
//============================================================================
// Default Functor Tests
//============================================================================
 
TEST(DftStoreNodeTest, TextMode)
{
  using Graph = List_Graph<Graph_Node<int>, Graph_Arc<int>>;
  Graph g;
  auto n = g.insert_node(12345);
  
  Dft_Store_Node<Graph> store;
  
  std::ostringstream ss;
  store(ss, g, n);
  
  EXPECT_TRUE(ss.str().find("12345") != std::string::npos);
}
 
TEST(DftStoreArcTest, TextMode)
{
  using Graph = List_Graph<Graph_Node<int>, Graph_Arc<double>>;
  Graph g;
  auto n1 = g.insert_node(1);
  auto n2 = g.insert_node(2);
  auto a = g.insert_arc(n1, n2, 3.14159);
  
  Dft_Store_Arc<Graph> store;
  
  std::ostringstream ss;
  store(ss, g, a);
  
  EXPECT_TRUE(ss.str().find("3.14") != std::string::npos);
}
 
TEST(DftLoadNodeTest, TextMode)
{
  using Graph = List_Graph<Graph_Node<int>, Graph_Arc<int>>;
  Graph g;
  auto n = g.insert_node(0);
  
  Dft_Load_Node<Graph> load;
  
  std::istringstream ss("999");
  load(ss, g, n);
  
  EXPECT_EQ(n->get_info(), 999);
}
 
TEST(DftLoadArcTest, TextMode)
{
  using Graph = List_Graph<Graph_Node<int>, Graph_Arc<double>>;
  Graph g;
  auto n1 = g.insert_node(1);
  auto n2 = g.insert_node(2);
  auto a = g.insert_arc(n1, n2, 0.0);
  
  Dft_Load_Arc<Graph> load;
  
  std::istringstream ss("2.718");
  load(ss, g, a);
  
  EXPECT_NEAR(a->get_info(), 2.718, 0.001);
}
 
//============================================================================
// Setter Tests
//============================================================================
 
TEST_F(IOGraphTest, SetLoadNode)
{
  IO_Graph<Graph> io(g);
  Dft_Load_Node<Graph> ln;
  io.set_load_node(ln);  // Should not throw
  SUCCEED();
}
 
TEST_F(IOGraphTest, SetStoreNode)
{
  IO_Graph<Graph> io(g);
  Dft_Store_Node<Graph> sn;
  io.set_store_node(sn);  // Should not throw
  SUCCEED();
}
 
TEST_F(IOGraphTest, SetLoadArc)
{
  IO_Graph<Graph> io(g);
  Dft_Load_Arc<Graph> la;
  io.set_load_arc(la);  // Should not throw
  SUCCEED();
}
 
TEST_F(IOGraphTest, SetStoreArc)
{
  IO_Graph<Graph> io(g);
  Dft_Store_Arc<Graph> sa;
  io.set_store_arc(sa);  // Should not throw
  SUCCEED();
}
 
//============================================================================
// Error Handling Tests
//============================================================================
 
TEST_F(IOGraphTest, LoadFromBadFile)
{
  Graph g2;
  IO_Graph<Graph> io(g2);
  
  std::ifstream bad_file("/nonexistent_file_12345.bin", std::ios::binary);
  
  // Loading from a bad stream should throw
  EXPECT_THROW(io.load(bad_file), std::runtime_error);
}
 
TEST_F(IOGraphTest, LoadTextFromBadFile)
{
  Graph g2;
  IO_Graph<Graph> io(g2);
  
  std::ifstream bad_file("/nonexistent_file_12345.txt");
  
  EXPECT_THROW(io.load_in_text_mode(bad_file), std::runtime_error);
}
 
//============================================================================
// Round-Trip Tests
//============================================================================
 
TEST_F(IOGraphTest, MultipleRoundTripsBinary)
{
  // First save
  {
    IO_Graph<Graph> io(g);
    std::ofstream out(binary_file, std::ios::binary);
    io.save(out);
  }
  
  // First load
  Graph g2;
  {
    IO_Graph<Graph> io(g2);
    std::ifstream in(binary_file, std::ios::binary);
    io.load(in);
  }
  
  EXPECT_EQ(g2.get_num_nodes(), 4u);
  
  // Second save (from loaded graph)
  std::string second_file = binary_file + ".2";
  {
    IO_Graph<Graph> io(g2);
    std::ofstream out(second_file, std::ios::binary);
    io.save(out);
  }
  
  // Second load
  Graph g3;
  {
    IO_Graph<Graph> io(g3);
    std::ifstream in(second_file, std::ios::binary);
    io.load(in);
  }
  
  EXPECT_EQ(g3.get_num_nodes(), 4u);
  EXPECT_EQ(g3.get_num_arcs(), 3u);
  
  std::remove(second_file.c_str());
}
 
TEST_F(IOGraphTest, MultipleRoundTripsText)
{
  // First save
  {
    IO_Graph<Graph> io(g);
    std::ofstream out(text_file);
    io.save_in_text_mode(out);
  }
  
  // First load
  Graph g2;
  {
    IO_Graph<Graph> io(g2);
    std::ifstream in(text_file);
    io.load_in_text_mode(in);
  }
  
  EXPECT_EQ(g2.get_num_nodes(), 4u);
  EXPECT_EQ(g2.get_num_arcs(), 3u);
}
 
//============================================================================
// Main
//============================================================================
 
int main(int argc, char **argv)
{
  ::testing::InitGoogleTest(&argc, argv);
  return RUN_ALL_TESTS();
}