89 lines
1.8 KiB
C++
89 lines
1.8 KiB
C++
#include <doctest/doctest.h>
|
|
|
|
#include "graph/digraph.h"
|
|
#include "graph/scc.h"
|
|
#include "algorithm/tarjan.h"
|
|
#include "algorithm/bfs.h"
|
|
|
|
using namespace graph;
|
|
|
|
TEST_SUITE("Algorithm.") {
|
|
|
|
TEST_CASE("Tarjan T_1") {
|
|
// 1 --> 2 --> 4 --> 1
|
|
// 2 --> 3 --> 5 --> 7 --> 3
|
|
// 5 --> 9 --> 6 --> 8 --> 9
|
|
Digraph<std::uint16_t> G;
|
|
G.insert(1, 2);
|
|
G.insert(2, 3);
|
|
G.insert(2, 4);
|
|
G.insert(3, 5);
|
|
G.insert(4, 1);
|
|
G.insert(5, 7);
|
|
G.insert(5, 9);
|
|
G.insert(6, 8);
|
|
G.insert(7, 3);
|
|
G.insert(8, 9);
|
|
G.insert(9, 6);
|
|
|
|
REQUIRE_EQ(G.vertices.size(), 9);
|
|
|
|
algo::Tarjan<std::uint16_t> tarjan(G);
|
|
auto result = tarjan.run();
|
|
|
|
for (auto& scc : result) {
|
|
scc.output();
|
|
}
|
|
|
|
std::vector<std::vector<std::uint16_t>> expected{
|
|
{1, 2, 4},
|
|
{3, 5, 7},
|
|
{6, 8, 9}
|
|
};
|
|
}
|
|
|
|
TEST_CASE("Tarjan T_2") {
|
|
// 1 --> 2 --> 5 --> 7 --> 2
|
|
// 1 --> 4 --> 3 --> 1
|
|
// 4 --> 6 --> 3
|
|
Digraph<std::uint16_t> G;
|
|
G.insert(1, 2);
|
|
G.insert(1, 4);
|
|
G.insert(2, 5);
|
|
G.insert(3, 1);
|
|
G.insert(4, 3);
|
|
G.insert(4, 6);
|
|
G.insert(5, 7);
|
|
G.insert(6, 3);
|
|
G.insert(7, 2);
|
|
|
|
REQUIRE_EQ(G.vertices.size(), 7);
|
|
|
|
algo::Tarjan<std::uint16_t> tarjan(G);
|
|
auto result = tarjan.run();
|
|
|
|
std::vector<std::vector<std::uint16_t>> expected{
|
|
{1, 3, 4, 6},
|
|
{2, 5, 7}
|
|
};
|
|
}
|
|
|
|
TEST_CASE("BFS T_1") {
|
|
// 1 --> 2 --> 5 --> 7 --> 2
|
|
// 1 --> 4 --> 3 --> 1
|
|
// 4 --> 6 --> 3
|
|
Digraph<std::uint16_t> G;
|
|
G.insert(1, 2);
|
|
G.insert(1, 4);
|
|
G.insert(2, 5);
|
|
G.insert(3, 1);
|
|
G.insert(4, 3);
|
|
G.insert(4, 6);
|
|
G.insert(5, 7);
|
|
G.insert(6, 3);
|
|
G.insert(7, 2);
|
|
|
|
algo::BFS<std::uint16_t> bfs(G, 1);
|
|
auto bfsTree = bfs.run();
|
|
}
|
|
} |