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

Add base paper and tarjan's SCC algorithm

Browse Source
This commit is contained in:
stefiosif
2022-05-06 12:25:04 +03:00
parent adb36adea7
commit 122d11b189
7 changed files with 186 additions and 67 deletions
Download Patch File Download Diff File Expand all files Collapse all files

14
test/graph_test.cc
View File

@@ -1,11 +1,13 @@
#include <doctest/doctest.h>
#include <cstdint>
#include "graph/graph.h"
using namespace graph;
#include "algorithm/tarjan.h"
#include "include/graph.h"
#include <cstdint>
#include <iostream>
TEST_SUITE("Testing Graph.") {
using namespace graph;
TEST_CASE("Insert vertices/edges.") {
Graph<std::uint16_t> G;
@@ -19,6 +21,12 @@ TEST_SUITE("Testing Graph.") {
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);