34 lines
653 B
C++
34 lines
653 B
C++
#include <doctest/doctest.h>
|
|
|
|
#include "graph/graph.h"
|
|
using namespace graph;
|
|
#include "algorithm/tarjan.h"
|
|
|
|
#include <cstdint>
|
|
#include <iostream>
|
|
|
|
TEST_SUITE("Testing Graph.") {
|
|
|
|
TEST_CASE("Insert vertices/edges.") {
|
|
Graph<std::uint16_t> G;
|
|
|
|
G.insert(1, 2);
|
|
G.insert(1, 4);
|
|
G.insert(1, 6);
|
|
G.insert(2, 4);
|
|
G.insert(2, 5);
|
|
G.insert(3, 4);
|
|
G.insert(3, 6);
|
|
G.insert(4, 6);
|
|
G.insert(5, 6);
|
|
|
|
Vertex<std::uint16_t> v1(1);
|
|
Vertex<std::uint16_t> v2(3);
|
|
Vertex<std::uint16_t> v3(5);
|
|
algorithm::Tarjan<std::uint16_t> tarjan(G);
|
|
tarjan.findSCC();
|
|
|
|
// CHECK_EQ(G.connected(1, 5), true);
|
|
|
|
}
|
|
} |