1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
|
#include <cstdlib>
#include <format>
#include <string>
#include <catch2/catch_all.hpp>
#include <cgraph/cgraph.h>
#include <gvc/gvc.h>
#include <pack/pack.h>
#include "svg_analyzer.h"
TEST_CASE("take an input graph, compute its connected components, lay out each "
"using neato, pack each layout into a single graph, and render that "
"graph in SVG") {
const auto directed_graph = GENERATE(false, true);
const std::string graph_type = directed_graph ? "digraph" : "graph";
const std::string edge_op = directed_graph ? "->" : "--";
const auto num_subgraphs = GENERATE(1ul, 2ul);
const std::string dot =
num_subgraphs == 1
? std::format("{} {{a {} b}}", graph_type, edge_op)
: std::format("{} {{a {} b; c {} d}}", graph_type, edge_op, edge_op);
INFO("DOT source: " << dot);
auto *g = agmemread(dot.c_str());
REQUIRE(g != nullptr);
aginit(g, AGRAPH, "Agraphinfo_t", sizeof(Agraphinfo_t), true);
aginit(g, AGNODE, "Agnodeinfo_t", sizeof(Agnodeinfo_t), true);
size_t ncc = 0;
auto **cc = ccomps(g, &ncc, NULL);
REQUIRE(ncc == num_subgraphs);
auto *gvc = gvContextPlugins(lt_preloaded_symbols, false);
for (size_t i = 0; i < ncc; i++) {
graph_t *sg = cc[i];
const auto nedges = graphviz_node_induce(sg, NULL);
REQUIRE(nedges == 1);
gvLayout(gvc, sg, "neato");
}
pack_graph(ncc, cc, g, 0);
char *result = nullptr;
size_t length = 0;
{
const auto rc = gvRenderData(gvc, g, "svg", &result, &length);
REQUIRE(rc == 0);
}
REQUIRE(result != nullptr);
REQUIRE(length > 0);
SVGAnalyzer svg_analyzer{result};
const std::size_t num_nodes = 2 * num_subgraphs;
const std::size_t num_edges = num_subgraphs;
const std::size_t num_arrowheads = directed_graph ? num_edges : 0;
const std::size_t num_svgs = 1;
const std::size_t num_groups = 1 + num_nodes + num_edges;
const std::size_t num_ellipses = num_nodes;
const std::size_t num_polygons = 1 + num_arrowheads;
const std::size_t num_paths = num_edges;
const std::size_t num_titles = num_nodes + num_edges;
CHECK(svg_analyzer.num_svgs() == num_svgs);
CHECK(svg_analyzer.num_groups() == num_groups);
CHECK(svg_analyzer.num_circles() == 0);
CHECK(svg_analyzer.num_ellipses() == num_ellipses);
CHECK(svg_analyzer.num_lines() == 0);
CHECK(svg_analyzer.num_paths() == num_paths);
CHECK(svg_analyzer.num_polygons() == num_polygons);
CHECK(svg_analyzer.num_polylines() == 0);
CHECK(svg_analyzer.num_rects() == 0);
CHECK(svg_analyzer.num_titles() == num_titles);
gvFreeRenderData(result);
for (size_t i = 0; i < ncc; i++) {
graph_t *sg = cc[i];
gvFreeLayout(gvc, sg);
agdelete(g, sg);
}
agclose(g);
gvFreeContext(gvc);
free(cc);
}
|
