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

Add BFS tree

Browse Source
This commit is contained in:
stefiosif
2022-06-11 19:27:03 +03:00
parent dfa8e649ee
commit b5b031db7f
4 changed files with 138 additions and 19 deletions
Download Patch File Download Diff File Expand all files Collapse all files

40
test/graph_test.cc
View File

@@ -1,23 +1,35 @@
#include <doctest/doctest.h>
#include "graph/graph.h"
#include "graph/scc.h"
using namespace graph;
#include "algorithm/tarjan.h"
TEST_SUITE("Graph test.") {
TEST_SUITE("Graph.") {
TEST_CASE("Insertion.") {
TEST_CASE("SCC") {
// 1 --> 2 --> 4 --> 1
// 2 --> 3 --> 5 --> 7 --> 3
// 5 --> 9 --> 6 --> 8 --> 9
Graph<std::uint16_t> G;
//G.insert(1);
//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);
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);
algo::Tarjan<std::uint16_t> tarjan(G);
auto tarjanOutput = tarjan.run();
std::vector<SCC<std::uint16_t>> SCCs;
for (const auto& scc : tarjanOutput) {
SCCs.push_back(scc);
}
}
}