139 lines
3.6 KiB
C++
139 lines
3.6 KiB
C++
#include <doctest/doctest.h>
|
|
|
|
#include "algorithm/henzinger_king.h"
|
|
#include "algorithm/king.h"
|
|
|
|
using namespace graph;
|
|
|
|
TEST_SUITE("Dynamic Reachability Test") {
|
|
|
|
TEST_CASE("King") {
|
|
// 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::King<std::uint16_t> king(G);
|
|
king.init();
|
|
|
|
SUBCASE("King::query") {
|
|
CHECK_EQ(king.query(1, 9), true);
|
|
CHECK_EQ(king.query(2, 8), true);
|
|
CHECK_EQ(king.query(3, 7), true);
|
|
CHECK_EQ(king.query(4, 3), false);
|
|
CHECK_EQ(king.query(5, 4), false);
|
|
CHECK_EQ(king.query(6, 1), false);
|
|
}
|
|
|
|
SUBCASE("King::remove") {
|
|
king.remove(4, 6);
|
|
|
|
CHECK_EQ(king.query(3, 6), true);
|
|
CHECK_EQ(king.query(4, 6), true);
|
|
|
|
king.remove(5, 6);
|
|
|
|
CHECK_EQ(king.query(1, 9), true);
|
|
CHECK_EQ(king.query(1, 6), false);
|
|
|
|
king.remove(1, 2);
|
|
|
|
CHECK_EQ(king.query(1, 5), true);
|
|
CHECK_EQ(king.query(1, 2), false);
|
|
}
|
|
|
|
SUBCASE("King::insert") {
|
|
king.insert(3, 10);
|
|
|
|
CHECK_EQ(king.query(1, 10), true);
|
|
CHECK_EQ(king.query(2, 10), false);
|
|
}
|
|
}
|
|
|
|
TEST_CASE("HenzingerKing") {
|
|
// 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::HenzingerKing<std::uint16_t> henzingerKing(G);
|
|
henzingerKing.init();
|
|
|
|
SUBCASE("HenzingerKing::query") {
|
|
CHECK_EQ(henzingerKing.query(1, 9), true);
|
|
CHECK_EQ(henzingerKing.query(2, 8), true);
|
|
CHECK_EQ(henzingerKing.query(3, 9), true);
|
|
CHECK_EQ(henzingerKing.query(9, 5), true);
|
|
CHECK_EQ(henzingerKing.query(4, 3), false);
|
|
CHECK_EQ(henzingerKing.query(5, 4), false);
|
|
CHECK_EQ(henzingerKing.query(6, 1), false);
|
|
}
|
|
|
|
SUBCASE("HenzingerKing::remove") {
|
|
henzingerKing.remove({ {7, 8}, {6, 8}, {3, 1} });
|
|
|
|
CHECK_EQ(henzingerKing.query(1, 3), true);
|
|
CHECK_EQ(henzingerKing.query(1, 9), true);
|
|
CHECK_EQ(henzingerKing.query(4, 5), true);
|
|
CHECK_EQ(henzingerKing.query(3, 1), false);
|
|
CHECK_EQ(henzingerKing.query(6, 8), false);
|
|
CHECK_EQ(henzingerKing.query(7, 8), false);
|
|
CHECK_EQ(henzingerKing.query(1, 8), false);
|
|
CHECK_EQ(henzingerKing.query(8, 4), false);
|
|
|
|
henzingerKing.remove({ {4, 5}, {5, 6} });
|
|
|
|
CHECK_EQ(henzingerKing.query(2, 9), true);
|
|
CHECK_EQ(henzingerKing.query(9, 6), false);
|
|
CHECK_EQ(henzingerKing.query(4, 6), false);
|
|
}
|
|
|
|
SUBCASE("HenzingerKing::insert") {
|
|
henzingerKing.insert(9, { { 1, 10 } });
|
|
|
|
CHECK_EQ(henzingerKing.query(1, 9), true);
|
|
CHECK_EQ(henzingerKing.query(9, 1), true);
|
|
|
|
CHECK_EQ(henzingerKing.query(1, 10), true);
|
|
CHECK_EQ(henzingerKing.query(10, 1), false);
|
|
}
|
|
}
|
|
} |