mirror of
https://git.rwth-aachen.de/acs/public/villas/node/
synced 2025-03-30 00:00:11 +01:00
112 lines
3.2 KiB
C++
112 lines
3.2 KiB
C++
#include <memory>
|
|
|
|
#include <criterion/criterion.h>
|
|
#include <villas/directed_graph.hpp>
|
|
#include <villas/log.hpp>
|
|
|
|
static void init_graph()
|
|
{
|
|
spdlog::set_pattern("[%T] [%l] [%n] %v");
|
|
spdlog::set_level(spdlog::level::debug);
|
|
}
|
|
|
|
TestSuite(graph,
|
|
.init = init_graph,
|
|
.description = "Graph library"
|
|
);
|
|
|
|
|
|
Test(graph, basic, .description = "DirectedGraph")
|
|
{
|
|
auto logger = loggerGetOrCreate("unittest:basic");
|
|
logger->info("Testing basic graph construction and modification");
|
|
|
|
villas::graph::DirectedGraph<> g("unittest:basic");
|
|
|
|
std::shared_ptr<villas::graph::Vertex> v1(new villas::graph::Vertex);
|
|
std::shared_ptr<villas::graph::Vertex> v2(new villas::graph::Vertex);
|
|
std::shared_ptr<villas::graph::Vertex> v3(new villas::graph::Vertex);
|
|
|
|
auto v1id = g.addVertex(v1);
|
|
auto v2id = g.addVertex(v2);
|
|
auto v3id = g.addVertex(v3);
|
|
cr_assert(g.getVertexCount() == 3);
|
|
|
|
g.addDefaultEdge(v1id, v2id);
|
|
g.addDefaultEdge(v3id, v2id);
|
|
g.addDefaultEdge(v1id, v3id);
|
|
g.addDefaultEdge(v2id, v1id);
|
|
cr_assert(g.getEdgeCount() == 4);
|
|
cr_assert(g.vertexGetEdges(v1id).size() == 2);
|
|
cr_assert(g.vertexGetEdges(v2id).size() == 1);
|
|
cr_assert(g.vertexGetEdges(v3id).size() == 1);
|
|
|
|
g.removeVertex(v1id);
|
|
g.dump();
|
|
cr_assert(g.getVertexCount() == 2);
|
|
cr_assert(g.vertexGetEdges(v2id).size() == 0);
|
|
}
|
|
|
|
Test(graph, path, .description = "Find path")
|
|
{
|
|
auto logger = loggerGetOrCreate("unittest:path");
|
|
logger->info("Testing path finding algorithm");
|
|
|
|
using Graph = villas::graph::DirectedGraph<>;
|
|
Graph g("unittest:path");
|
|
|
|
std::shared_ptr<villas::graph::Vertex> v1(new villas::graph::Vertex);
|
|
std::shared_ptr<villas::graph::Vertex> v2(new villas::graph::Vertex);
|
|
std::shared_ptr<villas::graph::Vertex> v3(new villas::graph::Vertex);
|
|
std::shared_ptr<villas::graph::Vertex> v4(new villas::graph::Vertex);
|
|
std::shared_ptr<villas::graph::Vertex> v5(new villas::graph::Vertex);
|
|
std::shared_ptr<villas::graph::Vertex> v6(new villas::graph::Vertex);
|
|
|
|
auto v1id = g.addVertex(v1);
|
|
auto v2id = g.addVertex(v2);
|
|
auto v3id = g.addVertex(v3);
|
|
|
|
auto v4id = g.addVertex(v4);
|
|
auto v5id = g.addVertex(v5);
|
|
auto v6id = g.addVertex(v6);
|
|
|
|
g.addDefaultEdge(v1id, v2id);
|
|
g.addDefaultEdge(v2id, v3id);
|
|
|
|
// create circular subgraph
|
|
g.addDefaultEdge(v4id, v5id);
|
|
g.addDefaultEdge(v5id, v4id);
|
|
g.addDefaultEdge(v5id, v6id);
|
|
|
|
g.dump();
|
|
|
|
logger->info("Find simple path via two edges");
|
|
std::list<Graph::EdgeIdentifier> path1;
|
|
cr_assert(g.getPath(v1id, v3id, path1));
|
|
|
|
logger->info(" Path from {} to {} via:", v1id, v3id);
|
|
for(auto& edge : path1) {
|
|
logger->info(" -> edge {}", edge);
|
|
}
|
|
|
|
logger->info("Find path between two unconnected sub-graphs");
|
|
std::list<Graph::EdgeIdentifier> path2;
|
|
cr_assert(not g.getPath(v1id, v4id, path2));
|
|
logger->info(" no path found -> ok");
|
|
|
|
|
|
logger->info("Find non-existing path in circular sub-graph");
|
|
std::list<Graph::EdgeIdentifier> path3;
|
|
cr_assert(not g.getPath(v4id, v2id, path3));
|
|
logger->info(" no path found -> ok");
|
|
|
|
|
|
logger->info("Find path in circular graph");
|
|
std::list<Graph::EdgeIdentifier> path4;
|
|
cr_assert(g.getPath(v4id, v6id, path4));
|
|
|
|
logger->info(" Path from {} to {} via:", v4id, v6id);
|
|
for(auto& edge : path4) {
|
|
logger->info(" -> edge {}", edge);
|
|
}
|
|
}
|