48 lines
865 B
C++
48 lines
865 B
C++
#include <doctest/doctest.h>
|
|
|
|
#include "graph/scc.h"
|
|
#include "algorithm/tarjan.h"
|
|
|
|
#include <vector>
|
|
|
|
using namespace graph;
|
|
|
|
TEST_SUITE("Graph") {
|
|
|
|
TEST_CASE("Digraph::reverse") {
|
|
// 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.adjMatrix.size(), 9);
|
|
|
|
auto R = G.reverse();
|
|
|
|
std::map<std::uint16_t, std::set<std::uint16_t>> X = {
|
|
{1, {4}},
|
|
{2, {1}},
|
|
{3, {2, 7}},
|
|
{4, {2}},
|
|
{5, {3}},
|
|
{6, {9}},
|
|
{7, {5}},
|
|
{8, {6}},
|
|
{9, {5, 8}}
|
|
};
|
|
|
|
CHECK_EQ(R, X);
|
|
}
|
|
|
|
} |