stefiosif/reachability-algorithms
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Refactor file names to better understand inheritance of the skeleton of RZ algorithms

Browse Source
This commit is contained in:
stefiosif
2022-09-25 17:27:21 +03:00
parent ffc3ae4ec3
commit 95e7d56c1e
8 changed files with 127 additions and 67 deletions
Download Patch File Download Diff File Expand all files Collapse all files

167
test/decremental_reachability_test.cc Normal file
View File

@@ -0,0 +1,167 @@
#include <doctest/doctest.h>
#include "algorithm/decremental_scc.h"
#include "algorithm/frigioni.h"
#include "algorithm/italiano.h"
using namespace graph;
TEST_SUITE("Decremental Reachability Test") {
TEST_CASE("DecrementalSCC") {
// 1 --> 2 --> 3 --> 1
// 3 --> 4 --> 5 --> 3
// 2 --> 6 --> 7 --> 8 --> 6
// 7 --> 9
// 6 --> 9 --> 10 --> 11 --> 12 --> 13 --> 9
// 12 --> 10
Digraph<std::uint16_t> G;
G.insert(1, 2);
G.insert(2, 3);
G.insert(3, 1);
G.insert(3, 4);
G.insert(4, 5);
G.insert(5, 3);
G.insert(2, 6);
G.insert(6, 7);
G.insert(7, 8);
G.insert(7, 9);
G.insert(8, 6);
G.insert(6, 9);
G.insert(9, 10);
G.insert(10, 11);
G.insert(11, 12);
G.insert(12, 13);
G.insert(13, 9);
G.insert(12, 10);
REQUIRE_EQ(G.adjMatrix.size(), 13);
algo::DecrementalSCC<std::uint16_t> decremental(G);
decremental.init();
SUBCASE("DecrementalSCC::query") {
CHECK_EQ(decremental.query(1, 5), true);
CHECK_EQ(decremental.query(1, 7), false);
CHECK_EQ(decremental.query(1, 9), false);
}
SUBCASE("DecrementalSCC::remove") {
decremental.remove(12, 10);
CHECK_EQ(decremental.query(12, 10), true);
CHECK_EQ(decremental.query(11, 10), true);
decremental.remove(9, 10);
CHECK_EQ(decremental.query(12, 13), false);
CHECK_EQ(decremental.query(10, 12), false);
decremental.remove(2, 6);
CHECK_EQ(decremental.query(5, 8), false);
CHECK_EQ(decremental.query(6, 8), true);
}
}
TEST_CASE("Italiano") {
// 1 --> 2 --> 4 --> 6 --> 8 --> 9
// 4 --> 5 --> 7 --> 8
// 7 --> 9
// 1 --> 3 --> 9
// 3 --> 5 --> 6
Digraph<std::uint16_t> G;
G.insert(1, 2);
G.insert(1, 3);
G.insert(2, 4);
G.insert(3, 5);
G.insert(3, 9);
G.insert(4, 5);
G.insert(4, 6);
G.insert(5, 6);
G.insert(5, 7);
G.insert(6, 8);
G.insert(7, 8);
G.insert(7, 9);
G.insert(8, 9);
REQUIRE_EQ(G.adjMatrix.size(), 9);
algo::Italiano<std::uint16_t> italiano(G);
italiano.init();
SUBCASE("Italiano::query") {
CHECK_EQ(italiano.query(1, 9), true);
CHECK_EQ(italiano.query(2, 8), true);
CHECK_EQ(italiano.query(3, 7), true);
CHECK_EQ(italiano.query(4, 3), false);
CHECK_EQ(italiano.query(5, 4), false);
CHECK_EQ(italiano.query(6, 1), false);
}
SUBCASE("Italiano::remove") {
italiano.remove(4, 6);
CHECK_EQ(italiano.query(3, 6), true);
CHECK_EQ(italiano.query(4, 6), true);
italiano.remove(5, 6);
CHECK_EQ(italiano.query(1, 9), true);
CHECK_EQ(italiano.query(1, 6), false);
}
}
TEST_CASE("Frigioni") {
// 1 --> 2 --> 4 --> 6 --> 8 --> 9 --> 5
// 4 --> 5 --> 7 --> 8
// 5 --> 6
// 7 --> 9
// 2 --> 3 --> 1
// 3 --> 5
// 3 --> 9
Digraph<std::uint16_t> G;
G.insert(1, 2);
G.insert(2, 4);
G.insert(2, 3);
G.insert(3, 1);
G.insert(3, 5);
G.insert(3, 9);
G.insert(4, 5);
G.insert(4, 6);
G.insert(5, 6);
G.insert(5, 7);
G.insert(6, 8);
G.insert(7, 8);
G.insert(7, 9);
G.insert(8, 9);
G.insert(9, 5);
REQUIRE_EQ(G.adjMatrix.size(), 9);
algo::Frigioni<std::uint16_t> frigioni(G);
frigioni.init();
SUBCASE("Frigioni::query") {
CHECK_EQ(frigioni.query(1, 9), true);
CHECK_EQ(frigioni.query(2, 8), true);
CHECK_EQ(frigioni.query(3, 9), true);
CHECK_EQ(frigioni.query(9, 5), true);
CHECK_EQ(frigioni.query(4, 3), false);
CHECK_EQ(frigioni.query(5, 4), false);
CHECK_EQ(frigioni.query(6, 1), false);
}
/*
SUBCASE("Frigioni::remove") {
frigioni.remove(4, 6);
CHECK_EQ(frigioni.query(1, 8), true);
CHECK_EQ(frigioni.query(3, 6), true);
frigioni.remove(4, 6);
CHECK_EQ(frigioni.query(1, 9), true);
CHECK_EQ(frigioni.query(1, 6), false);
}*/
}
}